./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label09.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5076c3e55bd424afffa48cc9c2c4663afdcf72b1cbafe747c454c6704690d793 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:39:17,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:39:17,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:39:17,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:39:17,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:39:17,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:39:17,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:39:17,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:39:17,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:39:17,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:39:17,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:39:17,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:39:17,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:39:17,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:39:17,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:39:17,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:39:17,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:39:17,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:39:17,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:39:17,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:39:17,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:39:17,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:39:17,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:39:17,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:39:17,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:39:17,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:39:17,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:39:17,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:39:17,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:39:17,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:39:17,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:39:17,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:39:17,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:39:17,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:39:17,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:39:17,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:39:17,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:39:17,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:39:17,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:39:17,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:39:17,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:39:17,179 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:17,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:39:17,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:39:17,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:39:17,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:39:17,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:39:17,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:39:17,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:39:17,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:39:17,202 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:39:17,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:39:17,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:39:17,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:39:17,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:39:17,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:39:17,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:39:17,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:39:17,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:39:17,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:39:17,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:39:17,204 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:39:17,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:39:17,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:39:17,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:39:17,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:39:17,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:17,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:39:17,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:39:17,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:39:17,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:39:17,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:39:17,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:39:17,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:39:17,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:39:17,207 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 -> 5076c3e55bd424afffa48cc9c2c4663afdcf72b1cbafe747c454c6704690d793 [2022-02-20 19:39:17,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:39:17,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:39:17,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:39:17,439 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:39:17,440 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:39:17,440 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_label09.c [2022-02-20 19:39:17,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8848ac6fd/bcd91171902c466483af13591e84b45f/FLAGefd2d3480 [2022-02-20 19:39:18,089 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:39:18,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label09.c [2022-02-20 19:39:18,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8848ac6fd/bcd91171902c466483af13591e84b45f/FLAGefd2d3480 [2022-02-20 19:39:18,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8848ac6fd/bcd91171902c466483af13591e84b45f [2022-02-20 19:39:18,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:39:18,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:39:18,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:18,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:39:18,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:39:18,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:18" (1/1) ... [2022-02-20 19:39:18,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8e8924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:18, skipping insertion in model container [2022-02-20 19:39:18,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:18" (1/1) ... [2022-02-20 19:39:18,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:39:18,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:39:18,754 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_label09.c[6354,6367] [2022-02-20 19:39:18,796 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_label09.c[14102,14115] [2022-02-20 19:39:19,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:19,269 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:39:19,299 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_label09.c[6354,6367] [2022-02-20 19:39:19,308 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_label09.c[14102,14115] [2022-02-20 19:39:19,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:19,611 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:39:19,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:19 WrapperNode [2022-02-20 19:39:19,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:19,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:19,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:39:19,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:39:19,616 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:19" (1/1) ... [2022-02-20 19:39:19,673 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:19" (1/1) ... [2022-02-20 19:39:20,006 INFO L137 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4976 [2022-02-20 19:39:20,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:20,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:39:20,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:39:20,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:39:20,014 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:19" (1/1) ... [2022-02-20 19:39:20,014 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:19" (1/1) ... [2022-02-20 19:39:20,047 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:19" (1/1) ... [2022-02-20 19:39:20,048 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:19" (1/1) ... [2022-02-20 19:39:20,170 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:19" (1/1) ... [2022-02-20 19:39:20,195 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:19" (1/1) ... [2022-02-20 19:39:20,234 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:19" (1/1) ... [2022-02-20 19:39:20,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:39:20,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:39:20,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:39:20,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:39:20,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:19" (1/1) ... [2022-02-20 19:39:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:20,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:39:20,324 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:20,339 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:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:39:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:39:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:39:20,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:39:20,432 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:39:20,433 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:39:26,771 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:39:26,790 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:39:26,790 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:39:26,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:26 BoogieIcfgContainer [2022-02-20 19:39:26,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:39:26,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:39:26,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:39:26,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:39:26,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:39:18" (1/3) ... [2022-02-20 19:39:26,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7addc8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:26, skipping insertion in model container [2022-02-20 19:39:26,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:19" (2/3) ... [2022-02-20 19:39:26,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7addc8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:26, skipping insertion in model container [2022-02-20 19:39:26,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:26" (3/3) ... [2022-02-20 19:39:26,799 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label09.c [2022-02-20 19:39:26,805 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:39:26,805 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:39:26,847 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:39:26,853 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:26,853 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:39:26,886 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:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:39:26,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:26,892 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:26,893 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 975463267, now seen corresponding path program 1 times [2022-02-20 19:39:26,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:26,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201238185] [2022-02-20 19:39:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:27,025 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; {881#true} is VALID [2022-02-20 19:39:27,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#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; {881#true} is VALID [2022-02-20 19:39:27,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#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; {881#true} is VALID [2022-02-20 19:39:27,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {881#true} is VALID [2022-02-20 19:39:27,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#true} init_#res#1 := init_~tmp~0#1; {881#true} is VALID [2022-02-20 19:39:27,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} 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; {881#true} is VALID [2022-02-20 19:39:27,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume 0 == main1_~i2~0#1;assume false; {882#false} is VALID [2022-02-20 19:39:27,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {882#false} assume !(node1_~m1~0#1 != ~nomsg~0); {882#false} is VALID [2022-02-20 19:39:27,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {882#false} ~mode1~0 := 0; {882#false} is VALID [2022-02-20 19:39:27,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {882#false} assume !(0 != ~mode2~0 % 256); {882#false} is VALID [2022-02-20 19:39:27,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {882#false} is VALID [2022-02-20 19:39:27,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume !(0 != ~mode3~0 % 256); {882#false} is VALID [2022-02-20 19:39:27,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {882#false} is VALID [2022-02-20 19:39:27,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {882#false} is VALID [2022-02-20 19:39:27,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {882#false} check_#res#1 := check_~tmp~1#1; {882#false} is VALID [2022-02-20 19:39:27,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:39:27,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {882#false} assume 0 == assert_~arg#1 % 256; {882#false} is VALID [2022-02-20 19:39:27,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-02-20 19:39:27,031 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:27,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:27,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201238185] [2022-02-20 19:39:27,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201238185] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:27,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:27,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:39:27,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762364542] [2022-02-20 19:39:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:27,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:27,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:27,076 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:27,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:39:27,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:27,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:39:27,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:39:27,098 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 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:28,476 INFO L93 Difference]: Finished difference Result 1734 states and 3292 transitions. [2022-02-20 19:39:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:39:28,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3292 transitions. [2022-02-20 19:39:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3292 transitions. [2022-02-20 19:39:28,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3292 transitions. [2022-02-20 19:39:31,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3292 edges. 3292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:31,174 INFO L225 Difference]: With dead ends: 1734 [2022-02-20 19:39:31,175 INFO L226 Difference]: Without dead ends: 812 [2022-02-20 19:39:31,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:39:31,182 INFO L933 BasicCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:31,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-02-20 19:39:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-02-20 19:39:31,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:31,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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,247 INFO L74 IsIncluded]: Start isIncluded. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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,249 INFO L87 Difference]: Start difference. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:31,274 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions. [2022-02-20 19:39:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:39:31,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:31,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:31,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 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 812 states. [2022-02-20 19:39:31,281 INFO L87 Difference]: Start difference. First operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 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 812 states. [2022-02-20 19:39:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:31,304 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions. [2022-02-20 19:39:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:39:31,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:31,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:31,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:31,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1533 transitions. [2022-02-20 19:39:31,331 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1533 transitions. Word has length 26 [2022-02-20 19:39:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:31,331 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1533 transitions. [2022-02-20 19:39:31,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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,332 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:39:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:39:31,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:31,332 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:31,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:39:31,333 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash 157814817, now seen corresponding path program 1 times [2022-02-20 19:39:31,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:31,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923948164] [2022-02-20 19:39:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:31,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {5094#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; {5094#true} is VALID [2022-02-20 19:39:31,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {5094#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; {5094#true} is VALID [2022-02-20 19:39:31,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {5094#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; {5094#true} is VALID [2022-02-20 19:39:31,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {5094#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5096#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:39:31,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {5096#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5097#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:39:31,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {5097#(= |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; {5098#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID [2022-02-20 19:39:31,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {5098#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {5095#false} is VALID [2022-02-20 19:39:31,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {5095#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5095#false} is VALID [2022-02-20 19:39:31,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {5095#false} ~mode1~0 := 0; {5095#false} is VALID [2022-02-20 19:39:31,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {5095#false} assume !(0 != ~mode2~0 % 256); {5095#false} is VALID [2022-02-20 19:39:31,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {5095#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5095#false} is VALID [2022-02-20 19:39:31,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {5095#false} assume !(0 != ~mode3~0 % 256); {5095#false} is VALID [2022-02-20 19:39:31,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {5095#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5095#false} is VALID [2022-02-20 19:39:31,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {5095#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5095#false} is VALID [2022-02-20 19:39:31,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {5095#false} check_#res#1 := check_~tmp~1#1; {5095#false} is VALID [2022-02-20 19:39:31,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {5095#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; {5095#false} is VALID [2022-02-20 19:39:31,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {5095#false} assume 0 == assert_~arg#1 % 256; {5095#false} is VALID [2022-02-20 19:39:31,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {5095#false} assume !false; {5095#false} is VALID [2022-02-20 19:39:31,395 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,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:31,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923948164] [2022-02-20 19:39:31,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923948164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:31,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:31,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:31,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763198710] [2022-02-20 19:39:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:31,397 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:31,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:31,397 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:31,411 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:31,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:31,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:31,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:31,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:31,413 INFO L87 Difference]: Start difference. First operand 812 states and 1533 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:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:35,088 INFO L93 Difference]: Finished difference Result 888 states and 1649 transitions. [2022-02-20 19:39:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:39:35,089 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:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:35,089 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:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:39:35,098 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:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:39:35,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1649 transitions. [2022-02-20 19:39:36,376 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:36,444 INFO L225 Difference]: With dead ends: 888 [2022-02-20 19:39:36,450 INFO L226 Difference]: Without dead ends: 848 [2022-02-20 19:39:36,469 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:36,471 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:36,472 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:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-02-20 19:39:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 812. [2022-02-20 19:39:36,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:36,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 848 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:36,511 INFO L74 IsIncluded]: Start isIncluded. First operand 848 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:36,513 INFO L87 Difference]: Start difference. First operand 848 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:36,565 INFO L93 Difference]: Finished difference Result 848 states and 1573 transitions. [2022-02-20 19:39:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1573 transitions. [2022-02-20 19:39:36,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:36,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:36,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 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 848 states. [2022-02-20 19:39:36,571 INFO L87 Difference]: Start difference. First operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 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 848 states. [2022-02-20 19:39:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:36,612 INFO L93 Difference]: Finished difference Result 848 states and 1573 transitions. [2022-02-20 19:39:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1573 transitions. [2022-02-20 19:39:36,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:36,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:36,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:36,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1517 transitions. [2022-02-20 19:39:36,651 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1517 transitions. Word has length 26 [2022-02-20 19:39:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:36,651 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1517 transitions. [2022-02-20 19:39:36,652 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:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions. [2022-02-20 19:39:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:36,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:36,653 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:36,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:39:36,654 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1324654887, now seen corresponding path program 1 times [2022-02-20 19:39:36,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:36,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103066391] [2022-02-20 19:39:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:36,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {8538#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; {8538#true} is VALID [2022-02-20 19:39:36,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {8538#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; {8538#true} is VALID [2022-02-20 19:39:36,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {8538#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; {8538#true} is VALID [2022-02-20 19:39:36,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {8538#true} assume 0 == ~r1~0; {8538#true} is VALID [2022-02-20 19:39:36,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {8538#true} assume ~id1~0 >= 0; {8538#true} is VALID [2022-02-20 19:39:36,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {8538#true} assume 0 == ~st1~0; {8538#true} is VALID [2022-02-20 19:39:36,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {8538#true} assume ~send1~0 == ~id1~0; {8538#true} is VALID [2022-02-20 19:39:36,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {8538#true} assume 0 == ~mode1~0 % 256; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {8540#(= (+ (* (- 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; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {8540#(= (+ (* (- 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; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {8540#(= (+ (* (- 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; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:36,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {8540#(= (+ (* (- 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; {8539#false} is VALID [2022-02-20 19:39:36,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {8539#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8539#false} is VALID [2022-02-20 19:39:36,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {8539#false} ~mode1~0 := 0; {8539#false} is VALID [2022-02-20 19:39:36,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {8539#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; {8539#false} is VALID [2022-02-20 19:39:36,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {8539#false} assume !(0 != ~mode2~0 % 256); {8539#false} is VALID [2022-02-20 19:39:36,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {8539#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8539#false} is VALID [2022-02-20 19:39:36,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {8539#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; {8539#false} is VALID [2022-02-20 19:39:36,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {8539#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; {8539#false} is VALID [2022-02-20 19:39:36,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {8539#false} assume !(0 != ~mode3~0 % 256); {8539#false} is VALID [2022-02-20 19:39:36,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {8539#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8539#false} is VALID [2022-02-20 19:39:36,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {8539#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; {8539#false} is VALID [2022-02-20 19:39:36,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {8539#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; {8539#false} is VALID [2022-02-20 19:39:36,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {8539#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8539#false} is VALID [2022-02-20 19:39:36,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {8539#false} check_#res#1 := check_~tmp~1#1; {8539#false} is VALID [2022-02-20 19:39:36,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {8539#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; {8539#false} is VALID [2022-02-20 19:39:36,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {8539#false} assume 0 == assert_~arg#1 % 256; {8539#false} is VALID [2022-02-20 19:39:36,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {8539#false} assume !false; {8539#false} is VALID [2022-02-20 19:39:36,801 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:36,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:36,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103066391] [2022-02-20 19:39:36,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103066391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:36,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:36,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:36,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009619929] [2022-02-20 19:39:36,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:36,804 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:36,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:36,805 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:36,836 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:36,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:36,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:36,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:36,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:36,838 INFO L87 Difference]: Start difference. First operand 812 states and 1517 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:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:38,611 INFO L93 Difference]: Finished difference Result 878 states and 1619 transitions. [2022-02-20 19:39:38,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:38,612 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:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:38,612 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:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:38,619 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:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:38,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:40,115 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:40,136 INFO L225 Difference]: With dead ends: 878 [2022-02-20 19:39:40,137 INFO L226 Difference]: Without dead ends: 842 [2022-02-20 19:39:40,137 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:40,138 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:40,138 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:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-02-20 19:39:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 840. [2022-02-20 19:39:40,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:40,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have 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,153 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have 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,154 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have 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,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:40,180 INFO L93 Difference]: Finished difference Result 842 states and 1562 transitions. [2022-02-20 19:39:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1562 transitions. [2022-02-20 19:39:40,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:40,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:40,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 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 842 states. [2022-02-20 19:39:40,184 INFO L87 Difference]: Start difference. First operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 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 842 states. [2022-02-20 19:39:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:40,209 INFO L93 Difference]: Finished difference Result 842 states and 1562 transitions. [2022-02-20 19:39:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1562 transitions. [2022-02-20 19:39:40,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:40,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:40,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:40,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have 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,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1561 transitions. [2022-02-20 19:39:40,236 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1561 transitions. Word has length 41 [2022-02-20 19:39:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:40,237 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1561 transitions. [2022-02-20 19:39:40,237 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:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1561 transitions. [2022-02-20 19:39:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:40,238 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:40,238 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:40,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:39:40,238 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027727, now seen corresponding path program 1 times [2022-02-20 19:39:40,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:40,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410544538] [2022-02-20 19:39:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:40,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {11987#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; {11987#true} is VALID [2022-02-20 19:39:40,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {11987#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; {11987#true} is VALID [2022-02-20 19:39:40,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {11987#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; {11987#true} is VALID [2022-02-20 19:39:40,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {11987#true} assume 0 == ~r1~0; {11987#true} is VALID [2022-02-20 19:39:40,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {11987#true} assume ~id1~0 >= 0; {11987#true} is VALID [2022-02-20 19:39:40,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {11987#true} assume 0 == ~st1~0; {11989#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:40,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {11989#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {11989#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:40,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {11989#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {11989#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:40,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {11989#(<= ~st1~0 0)} assume ~id2~0 >= 0; {11989#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:40,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {11989#(<= ~st1~0 0)} assume 0 == ~st2~0; {11990#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {11990#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {11990#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {11990#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {11990#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {11990#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {11990#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {11990#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:40,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {11988#false} is VALID [2022-02-20 19:39:40,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {11988#false} check_#res#1 := check_~tmp~1#1; {11988#false} is VALID [2022-02-20 19:39:40,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {11988#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; {11988#false} is VALID [2022-02-20 19:39:40,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {11988#false} assume 0 == assert_~arg#1 % 256; {11988#false} is VALID [2022-02-20 19:39:40,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {11988#false} assume !false; {11988#false} is VALID [2022-02-20 19:39:40,353 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:40,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:40,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410544538] [2022-02-20 19:39:40,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410544538] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:40,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:40,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:40,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471228087] [2022-02-20 19:39:40,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:40,356 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:40,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:40,357 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:40,383 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:40,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:40,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:40,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:40,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:40,384 INFO L87 Difference]: Start difference. First operand 840 states and 1561 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:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:42,487 INFO L93 Difference]: Finished difference Result 1224 states and 2161 transitions. [2022-02-20 19:39:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:39:42,487 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:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:42,488 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:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:42,496 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:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:42,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1853 transitions. [2022-02-20 19:39:44,029 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:44,067 INFO L225 Difference]: With dead ends: 1224 [2022-02-20 19:39:44,067 INFO L226 Difference]: Without dead ends: 1160 [2022-02-20 19:39:44,067 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:44,073 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:44,074 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:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-02-20 19:39:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 902. [2022-02-20 19:39:44,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:44,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:44,136 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:44,137 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:44,178 INFO L93 Difference]: Finished difference Result 1160 states and 2049 transitions. [2022-02-20 19:39:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2049 transitions. [2022-02-20 19:39:44,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:44,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:44,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 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 1160 states. [2022-02-20 19:39:44,192 INFO L87 Difference]: Start difference. First operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 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 1160 states. [2022-02-20 19:39:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:44,231 INFO L93 Difference]: Finished difference Result 1160 states and 2049 transitions. [2022-02-20 19:39:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2049 transitions. [2022-02-20 19:39:44,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:44,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:44,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:44,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1656 transitions. [2022-02-20 19:39:44,262 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1656 transitions. Word has length 41 [2022-02-20 19:39:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:44,263 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1656 transitions. [2022-02-20 19:39:44,263 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:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1656 transitions. [2022-02-20 19:39:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:44,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:44,265 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:44,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:39:44,265 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:44,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1902982177, now seen corresponding path program 1 times [2022-02-20 19:39:44,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:44,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994781822] [2022-02-20 19:39:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:44,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {16567#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; {16567#true} is VALID [2022-02-20 19:39:44,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {16567#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; {16567#true} is VALID [2022-02-20 19:39:44,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {16567#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; {16567#true} is VALID [2022-02-20 19:39:44,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {16567#true} assume 0 == ~r1~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {16569#(<= ~r1~0 0)} assume ~id1~0 >= 0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~st1~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {16569#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {16569#(<= ~r1~0 0)} assume ~id2~0 >= 0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~st2~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {16569#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {16569#(<= ~r1~0 0)} assume ~id3~0 >= 0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~st3~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {16569#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {16569#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {16569#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {16569#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {16569#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {16569#(<= ~r1~0 0)} assume !(0 == main1_~i2~0#1); {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {16569#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {16569#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {16569#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {16569#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {16569#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {16569#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {16569#(<= ~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; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {16569#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16569#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:44,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {16569#(<= ~r1~0 0)} assume ~r1~0 >= 3; {16568#false} is VALID [2022-02-20 19:39:44,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {16568#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {16568#false} is VALID [2022-02-20 19:39:44,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {16568#false} check_#res#1 := check_~tmp~1#1; {16568#false} is VALID [2022-02-20 19:39:44,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {16568#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; {16568#false} is VALID [2022-02-20 19:39:44,355 INFO L290 TraceCheckUtils]: 41: Hoare triple {16568#false} assume 0 == assert_~arg#1 % 256; {16568#false} is VALID [2022-02-20 19:39:44,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {16568#false} assume !false; {16568#false} is VALID [2022-02-20 19:39:44,356 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:44,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:44,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994781822] [2022-02-20 19:39:44,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994781822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:44,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:44,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:44,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409186872] [2022-02-20 19:39:44,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:44,358 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:44,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:44,358 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:44,377 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:44,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:44,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:44,378 INFO L87 Difference]: Start difference. First operand 902 states and 1656 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:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:45,708 INFO L93 Difference]: Finished difference Result 1089 states and 1943 transitions. [2022-02-20 19:39:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:45,708 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:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:45,709 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:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:45,718 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:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:45,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1620 transitions. [2022-02-20 19:39:46,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:47,012 INFO L225 Difference]: With dead ends: 1089 [2022-02-20 19:39:47,012 INFO L226 Difference]: Without dead ends: 963 [2022-02-20 19:39:47,012 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:47,013 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:47,013 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:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-02-20 19:39:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2022-02-20 19:39:47,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:47,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have 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,068 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have 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,069 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have 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,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:47,096 INFO L93 Difference]: Finished difference Result 963 states and 1745 transitions. [2022-02-20 19:39:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1745 transitions. [2022-02-20 19:39:47,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:47,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:47,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:39:47,100 INFO L87 Difference]: Start difference. First operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:39:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:47,127 INFO L93 Difference]: Finished difference Result 963 states and 1745 transitions. [2022-02-20 19:39:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1745 transitions. [2022-02-20 19:39:47,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:47,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:47,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:47,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have 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,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1744 transitions. [2022-02-20 19:39:47,157 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1744 transitions. Word has length 43 [2022-02-20 19:39:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:47,158 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1744 transitions. [2022-02-20 19:39:47,158 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:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1744 transitions. [2022-02-20 19:39:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:47,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:47,158 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,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:39:47,159 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488665, now seen corresponding path program 1 times [2022-02-20 19:39:47,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:47,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161094799] [2022-02-20 19:39:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:47,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {20656#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; {20656#true} is VALID [2022-02-20 19:39:47,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {20656#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; {20656#true} is VALID [2022-02-20 19:39:47,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {20656#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; {20656#true} is VALID [2022-02-20 19:39:47,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {20656#true} assume 0 == ~r1~0; {20656#true} is VALID [2022-02-20 19:39:47,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {20656#true} assume ~id1~0 >= 0; {20656#true} is VALID [2022-02-20 19:39:47,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {20656#true} assume 0 == ~st1~0; {20658#(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:47,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {20658#(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; {20658#(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:47,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {20658#(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; {20658#(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:47,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {20658#(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; {20658#(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:47,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {20658#(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; {20659#(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:47,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {20659#(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; {20659#(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:47,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {20659#(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; {20659#(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:47,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {20659#(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; {20659#(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:47,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {20659#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main1_~i2~0#1); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:47,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {20660#(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; {20657#false} is VALID [2022-02-20 19:39:47,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {20657#false} check_#res#1 := check_~tmp~1#1; {20657#false} is VALID [2022-02-20 19:39:47,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {20657#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; {20657#false} is VALID [2022-02-20 19:39:47,296 INFO L290 TraceCheckUtils]: 41: Hoare triple {20657#false} assume 0 == assert_~arg#1 % 256; {20657#false} is VALID [2022-02-20 19:39:47,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {20657#false} assume !false; {20657#false} is VALID [2022-02-20 19:39:47,296 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,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:47,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161094799] [2022-02-20 19:39:47,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161094799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:47,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:47,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:47,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390882691] [2022-02-20 19:39:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:47,297 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:47,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:47,299 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:47,328 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,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:47,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:47,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:47,330 INFO L87 Difference]: Start difference. First operand 961 states and 1744 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:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:49,024 INFO L93 Difference]: Finished difference Result 1146 states and 2026 transitions. [2022-02-20 19:39:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:39:49,024 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:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:49,024 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:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:39:49,030 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:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:39:49,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1627 transitions. [2022-02-20 19:39:50,436 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:50,462 INFO L225 Difference]: With dead ends: 1146 [2022-02-20 19:39:50,462 INFO L226 Difference]: Without dead ends: 963 [2022-02-20 19:39:50,462 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:50,463 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 1528 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:50,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 1685 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-02-20 19:39:50,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2022-02-20 19:39:50,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:50,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have 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,527 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have 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,528 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have 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,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:50,555 INFO L93 Difference]: Finished difference Result 963 states and 1742 transitions. [2022-02-20 19:39:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1742 transitions. [2022-02-20 19:39:50,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:50,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:50,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:39:50,558 INFO L87 Difference]: Start difference. First operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:39:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:50,585 INFO L93 Difference]: Finished difference Result 963 states and 1742 transitions. [2022-02-20 19:39:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1742 transitions. [2022-02-20 19:39:50,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:50,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:50,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:50,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have 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,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1741 transitions. [2022-02-20 19:39:50,616 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1741 transitions. Word has length 43 [2022-02-20 19:39:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:50,616 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1741 transitions. [2022-02-20 19:39:50,616 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:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1741 transitions. [2022-02-20 19:39:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:50,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:50,617 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:50,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:39:50,617 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash -47574589, now seen corresponding path program 1 times [2022-02-20 19:39:50,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:50,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521682345] [2022-02-20 19:39:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:50,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {24817#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; {24817#true} is VALID [2022-02-20 19:39:50,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {24817#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; {24817#true} is VALID [2022-02-20 19:39:50,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {24817#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; {24817#true} is VALID [2022-02-20 19:39:50,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {24817#true} assume 0 == ~r1~0; {24817#true} is VALID [2022-02-20 19:39:50,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {24817#true} assume ~id1~0 >= 0; {24817#true} is VALID [2022-02-20 19:39:50,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {24817#true} assume 0 == ~st1~0; {24817#true} is VALID [2022-02-20 19:39:50,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {24817#true} assume ~send1~0 == ~id1~0; {24817#true} is VALID [2022-02-20 19:39:50,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {24817#true} assume 0 == ~mode1~0 % 256; {24817#true} is VALID [2022-02-20 19:39:50,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {24817#true} assume ~id2~0 >= 0; {24817#true} is VALID [2022-02-20 19:39:50,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {24817#true} assume 0 == ~st2~0; {24817#true} is VALID [2022-02-20 19:39:50,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {24817#true} assume ~send2~0 == ~id2~0; {24817#true} is VALID [2022-02-20 19:39:50,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {24817#true} assume 0 == ~mode2~0 % 256; {24817#true} is VALID [2022-02-20 19:39:50,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {24817#true} assume ~id3~0 >= 0; {24817#true} is VALID [2022-02-20 19:39:50,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {24817#true} assume 0 == ~st3~0; {24817#true} is VALID [2022-02-20 19:39:50,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {24817#true} assume ~send3~0 == ~id3~0; {24817#true} is VALID [2022-02-20 19:39:50,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {24817#true} assume 0 == ~mode3~0 % 256; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:50,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {24819#(= (+ (* (- 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; {24818#false} is VALID [2022-02-20 19:39:50,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {24818#false} assume node3_~m3~0#1 != ~nomsg~0; {24818#false} is VALID [2022-02-20 19:39:50,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {24818#false} assume !(node3_~m3~0#1 > ~id3~0); {24818#false} is VALID [2022-02-20 19:39:50,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {24818#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {24818#false} is VALID [2022-02-20 19:39:50,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {24818#false} ~mode3~0 := 0; {24818#false} is VALID [2022-02-20 19:39:50,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {24818#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; {24818#false} is VALID [2022-02-20 19:39:50,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {24818#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {24818#false} is VALID [2022-02-20 19:39:50,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {24818#false} check_#res#1 := check_~tmp~1#1; {24818#false} is VALID [2022-02-20 19:39:50,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {24818#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; {24818#false} is VALID [2022-02-20 19:39:50,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {24818#false} assume 0 == assert_~arg#1 % 256; {24818#false} is VALID [2022-02-20 19:39:50,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {24818#false} assume !false; {24818#false} is VALID [2022-02-20 19:39:50,695 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:50,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:50,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521682345] [2022-02-20 19:39:50,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521682345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:50,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:50,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:50,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902899299] [2022-02-20 19:39:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:50,697 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:50,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:50,698 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:50,724 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:50,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:50,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:50,725 INFO L87 Difference]: Start difference. First operand 961 states and 1741 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:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:52,447 INFO L93 Difference]: Finished difference Result 1291 states and 2237 transitions. [2022-02-20 19:39:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:52,447 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:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:52,448 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:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:52,453 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:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:52,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:53,841 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:53,878 INFO L225 Difference]: With dead ends: 1291 [2022-02-20 19:39:53,878 INFO L226 Difference]: Without dead ends: 1108 [2022-02-20 19:39:53,879 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:53,879 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:53,880 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:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-02-20 19:39:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2022-02-20 19:39:54,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:54,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have 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,028 INFO L74 IsIncluded]: Start isIncluded. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have 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,029 INFO L87 Difference]: Start difference. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have 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,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:54,066 INFO L93 Difference]: Finished difference Result 1108 states and 1953 transitions. [2022-02-20 19:39:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1953 transitions. [2022-02-20 19:39:54,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:54,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:54,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 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 1108 states. [2022-02-20 19:39:54,071 INFO L87 Difference]: Start difference. First operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 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 1108 states. [2022-02-20 19:39:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:54,107 INFO L93 Difference]: Finished difference Result 1108 states and 1953 transitions. [2022-02-20 19:39:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1953 transitions. [2022-02-20 19:39:54,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:54,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:54,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:54,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have 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,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1952 transitions. [2022-02-20 19:39:54,148 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1952 transitions. Word has length 43 [2022-02-20 19:39:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:54,148 INFO L470 AbstractCegarLoop]: Abstraction has 1106 states and 1952 transitions. [2022-02-20 19:39:54,149 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:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1952 transitions. [2022-02-20 19:39:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:54,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:54,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:54,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:39:54,150 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:54,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:54,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1199933027, now seen corresponding path program 1 times [2022-02-20 19:39:54,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:54,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550530018] [2022-02-20 19:39:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:54,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {29624#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; {29624#true} is VALID [2022-02-20 19:39:54,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {29624#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; {29624#true} is VALID [2022-02-20 19:39:54,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {29624#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; {29624#true} is VALID [2022-02-20 19:39:54,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {29624#true} assume 0 == ~r1~0; {29624#true} is VALID [2022-02-20 19:39:54,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {29624#true} assume ~id1~0 >= 0; {29624#true} is VALID [2022-02-20 19:39:54,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {29624#true} assume 0 == ~st1~0; {29624#true} is VALID [2022-02-20 19:39:54,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {29624#true} assume ~send1~0 == ~id1~0; {29624#true} is VALID [2022-02-20 19:39:54,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {29624#true} assume 0 == ~mode1~0 % 256; {29624#true} is VALID [2022-02-20 19:39:54,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {29624#true} assume ~id2~0 >= 0; {29624#true} is VALID [2022-02-20 19:39:54,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {29624#true} assume 0 == ~st2~0; {29624#true} is VALID [2022-02-20 19:39:54,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {29624#true} assume ~send2~0 == ~id2~0; {29624#true} is VALID [2022-02-20 19:39:54,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {29624#true} assume 0 == ~mode2~0 % 256; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {29626#(= (+ (* (- 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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {29626#(= (+ (* (- 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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {29626#(= (+ (* (- 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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {29626#(= (+ (* (- 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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {29626#(= (+ (* (- 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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:54,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {29626#(= (+ (* (- 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; {29625#false} is VALID [2022-02-20 19:39:54,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {29625#false} assume node2_~m2~0#1 != ~nomsg~0; {29625#false} is VALID [2022-02-20 19:39:54,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {29625#false} assume !(node2_~m2~0#1 > ~id2~0); {29625#false} is VALID [2022-02-20 19:39:54,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {29625#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {29625#false} is VALID [2022-02-20 19:39:54,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {29625#false} ~mode2~0 := 0; {29625#false} is VALID [2022-02-20 19:39:54,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {29625#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; {29625#false} is VALID [2022-02-20 19:39:54,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {29625#false} assume !(0 != ~mode3~0 % 256); {29625#false} is VALID [2022-02-20 19:39:54,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {29625#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29625#false} is VALID [2022-02-20 19:39:54,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {29625#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; {29625#false} is VALID [2022-02-20 19:39:54,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {29625#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; {29625#false} is VALID [2022-02-20 19:39:54,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {29625#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {29625#false} is VALID [2022-02-20 19:39:54,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {29625#false} check_#res#1 := check_~tmp~1#1; {29625#false} is VALID [2022-02-20 19:39:54,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {29625#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; {29625#false} is VALID [2022-02-20 19:39:54,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {29625#false} assume 0 == assert_~arg#1 % 256; {29625#false} is VALID [2022-02-20 19:39:54,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {29625#false} assume !false; {29625#false} is VALID [2022-02-20 19:39:54,206 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:54,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:54,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550530018] [2022-02-20 19:39:54,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550530018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:54,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:54,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:54,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450709196] [2022-02-20 19:39:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:54,207 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:54,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:54,207 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:54,237 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:54,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:54,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:54,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:54,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:54,239 INFO L87 Difference]: Start difference. First operand 1106 states and 1952 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:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:55,829 INFO L93 Difference]: Finished difference Result 1690 states and 2810 transitions. [2022-02-20 19:39:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:55,829 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:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:55,829 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:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:55,835 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:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:55,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:57,014 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:57,063 INFO L225 Difference]: With dead ends: 1690 [2022-02-20 19:39:57,064 INFO L226 Difference]: Without dead ends: 1362 [2022-02-20 19:39:57,064 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:57,069 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:57,069 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:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2022-02-20 19:39:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1360. [2022-02-20 19:39:57,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:57,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have 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:57,276 INFO L74 IsIncluded]: Start isIncluded. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have 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:57,278 INFO L87 Difference]: Start difference. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have 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:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:57,326 INFO L93 Difference]: Finished difference Result 1362 states and 2309 transitions. [2022-02-20 19:39:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2309 transitions. [2022-02-20 19:39:57,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:57,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:57,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 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 1362 states. [2022-02-20 19:39:57,331 INFO L87 Difference]: Start difference. First operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 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 1362 states. [2022-02-20 19:39:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:57,378 INFO L93 Difference]: Finished difference Result 1362 states and 2309 transitions. [2022-02-20 19:39:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2309 transitions. [2022-02-20 19:39:57,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:57,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:57,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:57,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have 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:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2308 transitions. [2022-02-20 19:39:57,433 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2308 transitions. Word has length 43 [2022-02-20 19:39:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:57,433 INFO L470 AbstractCegarLoop]: Abstraction has 1360 states and 2308 transitions. [2022-02-20 19:39:57,433 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:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2308 transitions. [2022-02-20 19:39:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:39:57,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:57,434 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:57,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:39:57,434 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1511296967, now seen corresponding path program 1 times [2022-02-20 19:39:57,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:57,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601918718] [2022-02-20 19:39:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:57,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {35767#true} assume 0 == ~r1~0; {35767#true} is VALID [2022-02-20 19:39:57,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {35767#true} assume ~id1~0 >= 0; {35767#true} is VALID [2022-02-20 19:39:57,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {35767#true} assume 0 == ~st1~0; {35767#true} is VALID [2022-02-20 19:39:57,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {35767#true} assume ~send1~0 == ~id1~0; {35767#true} is VALID [2022-02-20 19:39:57,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {35767#true} assume 0 == ~mode1~0 % 256; {35767#true} is VALID [2022-02-20 19:39:57,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {35767#true} assume ~id2~0 >= 0; {35767#true} is VALID [2022-02-20 19:39:57,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {35767#true} assume 0 == ~st2~0; {35767#true} is VALID [2022-02-20 19:39:57,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {35767#true} assume ~send2~0 == ~id2~0; {35767#true} is VALID [2022-02-20 19:39:57,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {35767#true} assume 0 == ~mode2~0 % 256; {35767#true} is VALID [2022-02-20 19:39:57,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {35767#true} assume ~id3~0 >= 0; {35767#true} is VALID [2022-02-20 19:39:57,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {35767#true} assume 0 == ~st3~0; {35767#true} is VALID [2022-02-20 19:39:57,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {35767#true} assume ~send3~0 == ~id3~0; {35767#true} is VALID [2022-02-20 19:39:57,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {35767#true} assume 0 == ~mode3~0 % 256; {35767#true} is VALID [2022-02-20 19:39:57,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {35767#true} assume ~id1~0 != ~id2~0; {35767#true} is VALID [2022-02-20 19:39:57,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {35767#true} assume ~id1~0 != ~id3~0; {35767#true} is VALID [2022-02-20 19:39:57,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {35767#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {35769#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:39:57,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {35769#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {35770#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:39:57,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {35770#(= |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; {35771#(= |ULTIMATE.start_main1_~i2~0#1| 1)} is VALID [2022-02-20 19:39:57,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {35771#(= |ULTIMATE.start_main1_~i2~0#1| 1)} assume !(0 == main1_~i2~0#1); {35767#true} is VALID [2022-02-20 19:39:57,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {35767#true} assume !(0 != ~mode1~0 % 256); {35767#true} is VALID [2022-02-20 19:39:57,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {35767#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {35767#true} is VALID [2022-02-20 19:39:57,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {35767#true} assume !(0 != ~mode2~0 % 256); {35767#true} is VALID [2022-02-20 19:39:57,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {35767#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {35767#true} is VALID [2022-02-20 19:39:57,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {35767#true} assume !(0 != ~mode3~0 % 256); {35767#true} is VALID [2022-02-20 19:39:57,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {35767#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {35767#true} is VALID [2022-02-20 19:39:57,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {35767#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; {35767#true} is VALID [2022-02-20 19:39:57,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {35767#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35767#true} is VALID [2022-02-20 19:39:57,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {35767#true} assume !(~r1~0 >= 3); {35767#true} is VALID [2022-02-20 19:39:57,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {35767#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {35767#true} is VALID [2022-02-20 19:39:57,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {35767#true} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {35772#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:39:57,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {35772#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {35773#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:39:57,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {35773#(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; {35774#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:39:57,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {35774#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {35768#false} is VALID [2022-02-20 19:39:57,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {35768#false} assume !false; {35768#false} is VALID [2022-02-20 19:39:57,515 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:57,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:57,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601918718] [2022-02-20 19:39:57,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601918718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:57,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:57,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:39:57,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174040264] [2022-02-20 19:39:57,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:57,516 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:57,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:57,516 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:57,537 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:57,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:39:57,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:39:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:39:57,538 INFO L87 Difference]: Start difference. First operand 1360 states and 2308 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:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:04,478 INFO L93 Difference]: Finished difference Result 1883 states and 3036 transitions. [2022-02-20 19:40:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:40:04,478 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:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:04,478 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:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:40:04,483 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:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:40:04,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1577 transitions. [2022-02-20 19:40:05,554 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:05,693 INFO L225 Difference]: With dead ends: 1883 [2022-02-20 19:40:05,693 INFO L226 Difference]: Without dead ends: 1881 [2022-02-20 19:40:05,694 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:05,696 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:05,696 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:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2022-02-20 19:40:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1408. [2022-02-20 19:40:06,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:06,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have 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:06,107 INFO L74 IsIncluded]: Start isIncluded. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have 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:06,108 INFO L87 Difference]: Start difference. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have 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:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:06,199 INFO L93 Difference]: Finished difference Result 1881 states and 3015 transitions. [2022-02-20 19:40:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3015 transitions. [2022-02-20 19:40:06,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:06,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:06,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 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 1881 states. [2022-02-20 19:40:06,204 INFO L87 Difference]: Start difference. First operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 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 1881 states. [2022-02-20 19:40:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:06,295 INFO L93 Difference]: Finished difference Result 1881 states and 3015 transitions. [2022-02-20 19:40:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3015 transitions. [2022-02-20 19:40:06,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:06,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:06,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:06,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have 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:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2352 transitions. [2022-02-20 19:40:06,355 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2352 transitions. Word has length 44 [2022-02-20 19:40:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:06,355 INFO L470 AbstractCegarLoop]: Abstraction has 1408 states and 2352 transitions. [2022-02-20 19:40:06,355 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:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2352 transitions. [2022-02-20 19:40:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:06,356 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:06,356 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:06,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:40:06,356 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:06,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash -213997176, now seen corresponding path program 1 times [2022-02-20 19:40:06,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:06,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035284011] [2022-02-20 19:40:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:06,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {43305#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; {43305#true} is VALID [2022-02-20 19:40:06,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {43305#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; {43305#true} is VALID [2022-02-20 19:40:06,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {43305#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; {43305#true} is VALID [2022-02-20 19:40:06,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {43305#true} assume 0 == ~r1~0; {43305#true} is VALID [2022-02-20 19:40:06,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {43305#true} assume ~id1~0 >= 0; {43305#true} is VALID [2022-02-20 19:40:06,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {43305#true} assume 0 == ~st1~0; {43307#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:06,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {43307#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {43307#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:06,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {43307#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {43307#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:06,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {43307#(<= ~st1~0 0)} assume ~id2~0 >= 0; {43307#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:06,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {43307#(<= ~st1~0 0)} assume 0 == ~st2~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {43308#(<= (+ ~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; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,426 INFO L290 TraceCheckUtils]: 55: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {43308#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:06,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {43308#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {43309#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:06,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {43309#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {43309#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:06,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {43309#(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; {43309#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:06,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {43309#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {43306#false} is VALID [2022-02-20 19:40:06,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {43306#false} check_#res#1 := check_~tmp~1#1; {43306#false} is VALID [2022-02-20 19:40:06,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {43306#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; {43306#false} is VALID [2022-02-20 19:40:06,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {43306#false} assume 0 == assert_~arg#1 % 256; {43306#false} is VALID [2022-02-20 19:40:06,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {43306#false} assume !false; {43306#false} is VALID [2022-02-20 19:40:06,428 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:06,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:06,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035284011] [2022-02-20 19:40:06,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035284011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:06,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:06,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:06,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981475927] [2022-02-20 19:40:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:06,429 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:06,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:06,430 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:06,465 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:06,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:06,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:06,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:06,466 INFO L87 Difference]: Start difference. First operand 1408 states and 2352 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:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:10,557 INFO L93 Difference]: Finished difference Result 3436 states and 5200 transitions. [2022-02-20 19:40:10,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:10,557 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:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:10,557 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:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1738 transitions. [2022-02-20 19:40:10,564 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:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1738 transitions. [2022-02-20 19:40:10,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1738 transitions. [2022-02-20 19:40:11,833 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:12,074 INFO L225 Difference]: With dead ends: 3436 [2022-02-20 19:40:12,074 INFO L226 Difference]: Without dead ends: 2806 [2022-02-20 19:40:12,076 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:12,076 INFO L933 BasicCegarLoop]: 1563 mSDtfsCounter, 3073 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3073 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:12,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3073 Valid, 3184 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2022-02-20 19:40:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2036. [2022-02-20 19:40:12,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:12,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2806 states. Second operand has 2036 states, 2034 states have (on average 1.5870206489675516) internal successors, (3228), 2035 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have 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,910 INFO L74 IsIncluded]: Start isIncluded. First operand 2806 states. Second operand has 2036 states, 2034 states have (on average 1.5870206489675516) internal successors, (3228), 2035 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have 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,911 INFO L87 Difference]: Start difference. First operand 2806 states. Second operand has 2036 states, 2034 states have (on average 1.5870206489675516) internal successors, (3228), 2035 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have 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,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:13,129 INFO L93 Difference]: Finished difference Result 2806 states and 4299 transitions. [2022-02-20 19:40:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4299 transitions. [2022-02-20 19:40:13,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:13,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:13,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 2036 states, 2034 states have (on average 1.5870206489675516) internal successors, (3228), 2035 states have internal predecessors, (3228), 0 states have call successors, (0), 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 2806 states. [2022-02-20 19:40:13,135 INFO L87 Difference]: Start difference. First operand has 2036 states, 2034 states have (on average 1.5870206489675516) internal successors, (3228), 2035 states have internal predecessors, (3228), 0 states have call successors, (0), 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 2806 states. [2022-02-20 19:40:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:13,329 INFO L93 Difference]: Finished difference Result 2806 states and 4299 transitions. [2022-02-20 19:40:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4299 transitions. [2022-02-20 19:40:13,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:13,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:13,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:13,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 2034 states have (on average 1.5870206489675516) internal successors, (3228), 2035 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have 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,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 3228 transitions. [2022-02-20 19:40:13,460 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 3228 transitions. Word has length 64 [2022-02-20 19:40:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:13,460 INFO L470 AbstractCegarLoop]: Abstraction has 2036 states and 3228 transitions. [2022-02-20 19:40:13,460 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,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 3228 transitions. [2022-02-20 19:40:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:13,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:13,461 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,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:40:13,461 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1033510440, now seen corresponding path program 1 times [2022-02-20 19:40:13,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:13,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633433738] [2022-02-20 19:40:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:13,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {55387#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; {55387#true} is VALID [2022-02-20 19:40:13,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {55387#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; {55387#true} is VALID [2022-02-20 19:40:13,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {55387#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; {55387#true} is VALID [2022-02-20 19:40:13,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {55387#true} assume 0 == ~r1~0; {55387#true} is VALID [2022-02-20 19:40:13,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {55387#true} assume ~id1~0 >= 0; {55387#true} is VALID [2022-02-20 19:40:13,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {55387#true} assume 0 == ~st1~0; {55389#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {55389#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {55389#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {55389#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {55389#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {55389#(<= ~st1~0 0)} assume ~id2~0 >= 0; {55389#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {55389#(<= ~st1~0 0)} assume 0 == ~st2~0; {55389#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {55389#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {55389#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {55389#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {55389#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {55389#(<= ~st1~0 0)} assume ~id3~0 >= 0; {55389#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {55389#(<= ~st1~0 0)} assume 0 == ~st3~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {55390#(<= (+ ~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; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {55390#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {55390#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {55391#(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; {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 != ~mode3~0 % 256); {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {55391#(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; {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {55391#(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; {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {55391#(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; {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,535 INFO L290 TraceCheckUtils]: 59: Hoare triple {55391#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {55388#false} is VALID [2022-02-20 19:40:13,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {55388#false} check_#res#1 := check_~tmp~1#1; {55388#false} is VALID [2022-02-20 19:40:13,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {55388#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; {55388#false} is VALID [2022-02-20 19:40:13,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {55388#false} assume 0 == assert_~arg#1 % 256; {55388#false} is VALID [2022-02-20 19:40:13,536 INFO L290 TraceCheckUtils]: 63: Hoare triple {55388#false} assume !false; {55388#false} is VALID [2022-02-20 19:40:13,536 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,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:13,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633433738] [2022-02-20 19:40:13,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633433738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:13,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:13,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:13,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626227909] [2022-02-20 19:40:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:13,537 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,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:13,538 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,580 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,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:13,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:13,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:13,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:13,581 INFO L87 Difference]: Start difference. First operand 2036 states and 3228 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) [2022-02-20 19:40:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:17,988 INFO L93 Difference]: Finished difference Result 4064 states and 6076 transitions. [2022-02-20 19:40:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:17,989 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:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:40:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1738 transitions. [2022-02-20 19:40:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:40:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1738 transitions. [2022-02-20 19:40:17,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1738 transitions. [2022-02-20 19:40:18,965 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:19,380 INFO L225 Difference]: With dead ends: 4064 [2022-02-20 19:40:19,380 INFO L226 Difference]: Without dead ends: 3434 [2022-02-20 19:40:19,381 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:19,382 INFO L933 BasicCegarLoop]: 1564 mSDtfsCounter, 3067 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3067 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:19,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3067 Valid, 3203 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-02-20 19:40:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 2980. [2022-02-20 19:40:20,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:20,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3434 states. Second operand has 2980 states, 2978 states have (on average 1.5218267293485561) internal successors, (4532), 2979 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have 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:20,351 INFO L74 IsIncluded]: Start isIncluded. First operand 3434 states. Second operand has 2980 states, 2978 states have (on average 1.5218267293485561) internal successors, (4532), 2979 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have 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:20,353 INFO L87 Difference]: Start difference. First operand 3434 states. Second operand has 2980 states, 2978 states have (on average 1.5218267293485561) internal successors, (4532), 2979 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have 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:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:20,668 INFO L93 Difference]: Finished difference Result 3434 states and 5175 transitions. [2022-02-20 19:40:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 5175 transitions. [2022-02-20 19:40:20,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:20,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:20,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 2980 states, 2978 states have (on average 1.5218267293485561) internal successors, (4532), 2979 states have internal predecessors, (4532), 0 states have call successors, (0), 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 3434 states. [2022-02-20 19:40:20,676 INFO L87 Difference]: Start difference. First operand has 2980 states, 2978 states have (on average 1.5218267293485561) internal successors, (4532), 2979 states have internal predecessors, (4532), 0 states have call successors, (0), 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 3434 states. [2022-02-20 19:40:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:20,991 INFO L93 Difference]: Finished difference Result 3434 states and 5175 transitions. [2022-02-20 19:40:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 5175 transitions. [2022-02-20 19:40:20,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:20,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:20,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:20,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2978 states have (on average 1.5218267293485561) internal successors, (4532), 2979 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have 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:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4532 transitions. [2022-02-20 19:40:21,293 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4532 transitions. Word has length 64 [2022-02-20 19:40:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:21,293 INFO L470 AbstractCegarLoop]: Abstraction has 2980 states and 4532 transitions. [2022-02-20 19:40:21,293 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 19:40:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4532 transitions. [2022-02-20 19:40:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:21,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:21,294 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-02-20 19:40:21,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:40:21,294 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1792023874, now seen corresponding path program 1 times [2022-02-20 19:40:21,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:21,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863968907] [2022-02-20 19:40:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:21,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {70689#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; {70689#true} is VALID [2022-02-20 19:40:21,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {70689#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; {70689#true} is VALID [2022-02-20 19:40:21,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {70689#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; {70689#true} is VALID [2022-02-20 19:40:21,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {70689#true} assume 0 == ~r1~0; {70689#true} is VALID [2022-02-20 19:40:21,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {70689#true} assume ~id1~0 >= 0; {70689#true} is VALID [2022-02-20 19:40:21,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {70689#true} assume 0 == ~st1~0; {70689#true} is VALID [2022-02-20 19:40:21,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {70689#true} assume ~send1~0 == ~id1~0; {70689#true} is VALID [2022-02-20 19:40:21,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {70689#true} assume 0 == ~mode1~0 % 256; {70689#true} is VALID [2022-02-20 19:40:21,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {70689#true} assume ~id2~0 >= 0; {70689#true} is VALID [2022-02-20 19:40:21,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {70689#true} assume 0 == ~st2~0; {70691#(<= ~st2~0 0)} is VALID [2022-02-20 19:40:21,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {70691#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {70691#(<= ~st2~0 0)} is VALID [2022-02-20 19:40:21,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {70691#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {70691#(<= ~st2~0 0)} is VALID [2022-02-20 19:40:21,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {70691#(<= ~st2~0 0)} assume ~id3~0 >= 0; {70691#(<= ~st2~0 0)} is VALID [2022-02-20 19:40:21,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {70691#(<= ~st2~0 0)} assume 0 == ~st3~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} init_#res#1 := init_~tmp~0#1; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main1_~i2~0#1); {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {70692#(<= (+ ~st3~0 ~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {70692#(<= (+ ~st3~0 ~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {70692#(<= (+ ~st3~0 ~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 3); {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} check_#res#1 := check_~tmp~1#1; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == assert_~arg#1 % 256); {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {70692#(<= (+ ~st3~0 ~st2~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; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume node1_~m1~0#1 != ~nomsg~0; {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume !(node1_~m1~0#1 > ~id1~0); {70692#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 19:40:21,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {70692#(<= (+ ~st3~0 ~st2~0) 0)} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~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; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 != ~mode2~0 % 256); {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~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; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~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; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 != ~mode3~0 % 256); {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~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; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~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; {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 19:40:21,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {70693#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {70690#false} is VALID [2022-02-20 19:40:21,373 INFO L290 TraceCheckUtils]: 60: Hoare triple {70690#false} check_#res#1 := check_~tmp~1#1; {70690#false} is VALID [2022-02-20 19:40:21,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {70690#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; {70690#false} is VALID [2022-02-20 19:40:21,373 INFO L290 TraceCheckUtils]: 62: Hoare triple {70690#false} assume 0 == assert_~arg#1 % 256; {70690#false} is VALID [2022-02-20 19:40:21,373 INFO L290 TraceCheckUtils]: 63: Hoare triple {70690#false} assume !false; {70690#false} is VALID [2022-02-20 19:40:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:40:21,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:21,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863968907] [2022-02-20 19:40:21,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863968907] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:21,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:21,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:21,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582398909] [2022-02-20 19:40:21,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:21,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:40:21,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:21,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:21,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:21,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:21,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:21,417 INFO L87 Difference]: Start difference. First operand 2980 states and 4532 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)