./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label02.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71ab165d8600c7bf3c601364205c3c131ed910663de3282b3121f676cf35500e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:41:29,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:41:29,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:41:29,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:41:29,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:41:29,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:41:29,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:41:29,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:41:29,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:41:29,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:41:29,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:41:29,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:41:29,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:41:29,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:41:29,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:41:29,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:41:29,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:41:29,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:41:29,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:41:29,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:41:29,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:41:29,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:41:29,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:41:29,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:41:29,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:41:29,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:41:29,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:41:29,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:41:29,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:41:29,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:41:29,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:41:29,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:41:29,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:41:29,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:41:29,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:41:29,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:41:29,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:41:29,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:41:29,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:41:29,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:41:29,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:41:29,771 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:41:29,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:41:29,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:41:29,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:41:29,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:41:29,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:41:29,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:41:29,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:41:29,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:41:29,798 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:41:29,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:41:29,799 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:41:29,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:41:29,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:41:29,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:41:29,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:41:29,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:41:29,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:41:29,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:41:29,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:41:29,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:41:29,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:41:29,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:41:29,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:41:29,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:41:29,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:41:29,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:41:29,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:41:29,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:41:29,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:41:29,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:41:29,803 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:41:29,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:41:29,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:41:29,803 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 -> 71ab165d8600c7bf3c601364205c3c131ed910663de3282b3121f676cf35500e [2022-02-20 19:41:29,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:41:30,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:41:30,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:41:30,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:41:30,025 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:41:30,026 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label02.c [2022-02-20 19:41:30,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b29fbd9f/ca9f17f00cee4fdc8e5424f03c8fa183/FLAG8060d1346 [2022-02-20 19:41:30,633 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:41:30,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label02.c [2022-02-20 19:41:30,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b29fbd9f/ca9f17f00cee4fdc8e5424f03c8fa183/FLAG8060d1346 [2022-02-20 19:41:30,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b29fbd9f/ca9f17f00cee4fdc8e5424f03c8fa183 [2022-02-20 19:41:30,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:41:30,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:41:30,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:41:30,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:41:30,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:41:30,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:41:30" (1/1) ... [2022-02-20 19:41:30,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481b52be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:30, skipping insertion in model container [2022-02-20 19:41:30,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:41:30" (1/1) ... [2022-02-20 19:41:30,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:41:30,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:41:31,221 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.4.ufo.BOUNDED-8.pals+Problem12_label02.c[8616,8629] [2022-02-20 19:41:31,316 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.4.ufo.BOUNDED-8.pals+Problem12_label02.c[15906,15919] [2022-02-20 19:41:31,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:41:31,875 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:41:31,906 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.4.ufo.BOUNDED-8.pals+Problem12_label02.c[8616,8629] [2022-02-20 19:41:31,915 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.4.ufo.BOUNDED-8.pals+Problem12_label02.c[15906,15919] [2022-02-20 19:41:32,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:41:32,367 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:41:32,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32 WrapperNode [2022-02-20 19:41:32,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:41:32,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:41:32,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:41:32,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:41:32,374 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:41:32" (1/1) ... [2022-02-20 19:41:32,416 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:41:32" (1/1) ... [2022-02-20 19:41:32,703 INFO L137 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5031 [2022-02-20 19:41:32,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:41:32,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:41:32,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:41:32,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:41:32,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:32,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:32,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:32,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:32,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:32,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:32,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:33,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:41:33,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:41:33,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:41:33,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:41:33,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:41:33,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:41:33,121 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:41:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:41:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:41:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:41:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:41:33,151 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:41:33,342 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:41:33,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:41:40,076 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:41:40,093 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:41:40,093 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:41:40,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:41:40 BoogieIcfgContainer [2022-02-20 19:41:40,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:41:40,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:41:40,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:41:40,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:41:40,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:41:30" (1/3) ... [2022-02-20 19:41:40,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd2d66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:41:40, skipping insertion in model container [2022-02-20 19:41:40,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32" (2/3) ... [2022-02-20 19:41:40,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd2d66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:41:40, skipping insertion in model container [2022-02-20 19:41:40,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:41:40" (3/3) ... [2022-02-20 19:41:40,102 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label02.c [2022-02-20 19:41:40,107 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:41:40,107 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:41:40,153 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:41:40,165 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:41:40,165 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:41:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:41:40,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:40,201 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] [2022-02-20 19:41:40,202 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1675876582, now seen corresponding path program 1 times [2022-02-20 19:41:40,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:40,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956407627] [2022-02-20 19:41:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:40,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {896#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {896#true} is VALID [2022-02-20 19:41:40,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {896#true} is VALID [2022-02-20 19:41:40,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {896#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {896#true} is VALID [2022-02-20 19:41:40,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {896#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {896#true} is VALID [2022-02-20 19:41:40,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {896#true} init_#res#1 := init_~tmp~0#1; {896#true} is VALID [2022-02-20 19:41:40,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {896#true} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {896#true} is VALID [2022-02-20 19:41:40,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {896#true} assume 0 == main1_~i2~0#1;assume false; {897#false} is VALID [2022-02-20 19:41:40,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {897#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {897#false} is VALID [2022-02-20 19:41:40,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {897#false} assume !!(main1_~i2~0#1 < 8);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; {897#false} is VALID [2022-02-20 19:41:40,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {897#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {897#false} assume !(node1_~m1~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:41:40,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#false} ~mode1~0 := 0; {897#false} is VALID [2022-02-20 19:41:40,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#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; {897#false} is VALID [2022-02-20 19:41:40,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {897#false} assume !(node2_~m2~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:41:40,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {897#false} ~mode2~0 := 0; {897#false} is VALID [2022-02-20 19:41:40,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {897#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; {897#false} is VALID [2022-02-20 19:41:40,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {897#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {897#false} assume !(node3_~m3~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:41:40,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {897#false} ~mode3~0 := 0; {897#false} is VALID [2022-02-20 19:41:40,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {897#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {897#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {897#false} assume !(node4_~m4~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:41:40,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {897#false} ~mode4~0 := 0; {897#false} is VALID [2022-02-20 19:41:40,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {897#false} is VALID [2022-02-20 19:41:40,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {897#false} is VALID [2022-02-20 19:41:40,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {897#false} check_#res#1 := check_~tmp~1#1; {897#false} is VALID [2022-02-20 19:41:40,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {897#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {897#false} is VALID [2022-02-20 19:41:40,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {897#false} assume 0 == assert_~arg#1 % 256; {897#false} is VALID [2022-02-20 19:41:40,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {897#false} assume !false; {897#false} is VALID [2022-02-20 19:41:40,373 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:41:40,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:40,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956407627] [2022-02-20 19:41:40,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956407627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:40,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:40,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:41:40,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153815781] [2022-02-20 19:41:40,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:40,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:40,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:40,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:40,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:41:40,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:40,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:41:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:41:40,440 INFO L87 Difference]: Start difference. First operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:41,604 INFO L93 Difference]: Finished difference Result 1757 states and 3332 transitions. [2022-02-20 19:41:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:41:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3332 transitions. [2022-02-20 19:41:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3332 transitions. [2022-02-20 19:41:41,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3332 transitions. [2022-02-20 19:41:44,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3332 edges. 3332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:44,295 INFO L225 Difference]: With dead ends: 1757 [2022-02-20 19:41:44,296 INFO L226 Difference]: Without dead ends: 827 [2022-02-20 19:41:44,302 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:41:44,306 INFO L933 BasicCegarLoop]: 1627 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, 1627 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:41:44,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-02-20 19:41:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-02-20 19:41:44,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:44,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:44,418 INFO L74 IsIncluded]: Start isIncluded. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:44,420 INFO L87 Difference]: Start difference. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:44,447 INFO L93 Difference]: Finished difference Result 827 states and 1560 transitions. [2022-02-20 19:41:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:41:44,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:44,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:44,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:41:44,458 INFO L87 Difference]: Start difference. First operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:41:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:44,485 INFO L93 Difference]: Finished difference Result 827 states and 1560 transitions. [2022-02-20 19:41:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:41:44,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:44,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:44,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:44,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1560 transitions. [2022-02-20 19:41:44,518 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1560 transitions. Word has length 30 [2022-02-20 19:41:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:44,523 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1560 transitions. [2022-02-20 19:41:44,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:41:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:41:44,524 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:44,524 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] [2022-02-20 19:41:44,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:41:44,525 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:44,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1541863076, now seen corresponding path program 1 times [2022-02-20 19:41:44,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:44,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394725265] [2022-02-20 19:41:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:44,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {5180#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {5180#true} is VALID [2022-02-20 19:41:44,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {5180#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {5180#true} is VALID [2022-02-20 19:41:44,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {5180#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5180#true} is VALID [2022-02-20 19:41:44,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {5180#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5182#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:41:44,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {5182#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5183#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:41:44,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {5183#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {5184#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID [2022-02-20 19:41:44,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {5184#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {5181#false} is VALID [2022-02-20 19:41:44,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {5181#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5181#false} is VALID [2022-02-20 19:41:44,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {5181#false} assume !!(main1_~i2~0#1 < 8);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; {5181#false} is VALID [2022-02-20 19:41:44,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {5181#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:44,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {5181#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5181#false} is VALID [2022-02-20 19:41:44,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {5181#false} ~mode1~0 := 0; {5181#false} is VALID [2022-02-20 19:41:44,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {5181#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; {5181#false} is VALID [2022-02-20 19:41:44,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {5181#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:44,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {5181#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5181#false} is VALID [2022-02-20 19:41:44,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {5181#false} ~mode2~0 := 0; {5181#false} is VALID [2022-02-20 19:41:44,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {5181#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; {5181#false} is VALID [2022-02-20 19:41:44,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {5181#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:44,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {5181#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5181#false} is VALID [2022-02-20 19:41:44,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {5181#false} ~mode3~0 := 0; {5181#false} is VALID [2022-02-20 19:41:44,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {5181#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:44,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {5181#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:44,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {5181#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5181#false} is VALID [2022-02-20 19:41:44,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {5181#false} ~mode4~0 := 0; {5181#false} is VALID [2022-02-20 19:41:44,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {5181#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5181#false} is VALID [2022-02-20 19:41:44,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {5181#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {5181#false} is VALID [2022-02-20 19:41:44,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {5181#false} check_#res#1 := check_~tmp~1#1; {5181#false} is VALID [2022-02-20 19:41:44,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {5181#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {5181#false} is VALID [2022-02-20 19:41:44,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {5181#false} assume 0 == assert_~arg#1 % 256; {5181#false} is VALID [2022-02-20 19:41:44,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {5181#false} assume !false; {5181#false} is VALID [2022-02-20 19:41:44,619 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:41:44,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:44,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394725265] [2022-02-20 19:41:44,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394725265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:44,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:44,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:41:44,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116568795] [2022-02-20 19:41:44,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:44,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:44,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:44,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:44,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:41:44,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:44,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:41:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:41:44,658 INFO L87 Difference]: Start difference. First operand 827 states and 1560 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:49,049 INFO L93 Difference]: Finished difference Result 919 states and 1702 transitions. [2022-02-20 19:41:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:41:49,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1702 transitions. [2022-02-20 19:41:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1702 transitions. [2022-02-20 19:41:49,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1702 transitions. [2022-02-20 19:41:50,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1702 edges. 1702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:50,335 INFO L225 Difference]: With dead ends: 919 [2022-02-20 19:41:50,335 INFO L226 Difference]: Without dead ends: 871 [2022-02-20 19:41:50,338 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:41:50,340 INFO L933 BasicCegarLoop]: 1556 mSDtfsCounter, 71 mSDsluCounter, 4640 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 6196 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:41:50,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 6196 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-20 19:41:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 827. [2022-02-20 19:41:50,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:50,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 871 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,363 INFO L74 IsIncluded]: Start isIncluded. First operand 871 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,365 INFO L87 Difference]: Start difference. First operand 871 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:50,389 INFO L93 Difference]: Finished difference Result 871 states and 1606 transitions. [2022-02-20 19:41:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1606 transitions. [2022-02-20 19:41:50,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:50,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:50,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 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 871 states. [2022-02-20 19:41:50,393 INFO L87 Difference]: Start difference. First operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 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 871 states. [2022-02-20 19:41:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:50,457 INFO L93 Difference]: Finished difference Result 871 states and 1606 transitions. [2022-02-20 19:41:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1606 transitions. [2022-02-20 19:41:50,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:50,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:50,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:50,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1537 transitions. [2022-02-20 19:41:50,483 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1537 transitions. Word has length 30 [2022-02-20 19:41:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:50,483 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1537 transitions. [2022-02-20 19:41:50,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1537 transitions. [2022-02-20 19:41:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:41:50,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:50,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:41:50,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:41:50,486 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:50,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash 159296799, now seen corresponding path program 1 times [2022-02-20 19:41:50,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:50,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793503213] [2022-02-20 19:41:50,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:50,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:50,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {8720#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {8720#true} is VALID [2022-02-20 19:41:50,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {8720#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {8720#true} is VALID [2022-02-20 19:41:50,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {8720#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8720#true} is VALID [2022-02-20 19:41:50,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {8720#true} assume 0 == ~r1~0; {8720#true} is VALID [2022-02-20 19:41:50,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {8720#true} assume ~id1~0 >= 0; {8720#true} is VALID [2022-02-20 19:41:50,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {8720#true} assume 0 == ~st1~0; {8720#true} is VALID [2022-02-20 19:41:50,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {8720#true} assume ~send1~0 == ~id1~0; {8720#true} is VALID [2022-02-20 19:41:50,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {8720#true} assume 0 == ~mode1~0 % 256; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {8722#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 8);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; {8722#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:50,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {8722#(= (+ (* (- 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8721#false} is VALID [2022-02-20 19:41:50,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {8721#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8721#false} is VALID [2022-02-20 19:41:50,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {8721#false} ~mode1~0 := 0; {8721#false} is VALID [2022-02-20 19:41:50,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {8721#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; {8721#false} is VALID [2022-02-20 19:41:50,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {8721#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8721#false} is VALID [2022-02-20 19:41:50,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {8721#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8721#false} is VALID [2022-02-20 19:41:50,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {8721#false} ~mode2~0 := 0; {8721#false} is VALID [2022-02-20 19:41:50,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {8721#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; {8721#false} is VALID [2022-02-20 19:41:50,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {8721#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8721#false} is VALID [2022-02-20 19:41:50,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {8721#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8721#false} is VALID [2022-02-20 19:41:50,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {8721#false} ~mode3~0 := 0; {8721#false} is VALID [2022-02-20 19:41:50,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {8721#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8721#false} is VALID [2022-02-20 19:41:50,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {8721#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8721#false} is VALID [2022-02-20 19:41:50,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {8721#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8721#false} is VALID [2022-02-20 19:41:50,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {8721#false} ~mode4~0 := 0; {8721#false} is VALID [2022-02-20 19:41:50,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {8721#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8721#false} is VALID [2022-02-20 19:41:50,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {8721#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {8721#false} is VALID [2022-02-20 19:41:50,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {8721#false} check_#res#1 := check_~tmp~1#1; {8721#false} is VALID [2022-02-20 19:41:50,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {8721#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {8721#false} is VALID [2022-02-20 19:41:50,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {8721#false} assume 0 == assert_~arg#1 % 256; {8721#false} is VALID [2022-02-20 19:41:50,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-02-20 19:41:50,638 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:41:50,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:50,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793503213] [2022-02-20 19:41:50,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793503213] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:50,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:50,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:41:50,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064419801] [2022-02-20 19:41:50,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:50,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:41:50,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:50,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:50,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:41:50,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:41:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:41:50,670 INFO L87 Difference]: Start difference. First operand 827 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:52,367 INFO L93 Difference]: Finished difference Result 909 states and 1665 transitions. [2022-02-20 19:41:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:41:52,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:41:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:41:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:41:52,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:41:53,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:53,571 INFO L225 Difference]: With dead ends: 909 [2022-02-20 19:41:53,571 INFO L226 Difference]: Without dead ends: 865 [2022-02-20 19:41:53,574 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:41:53,575 INFO L933 BasicCegarLoop]: 1592 mSDtfsCounter, 1498 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1659 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:41:53,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1659 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:53,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2022-02-20 19:41:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 863. [2022-02-20 19:41:53,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:53,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 865 states. Second operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:53,589 INFO L74 IsIncluded]: Start isIncluded. First operand 865 states. Second operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:53,590 INFO L87 Difference]: Start difference. First operand 865 states. Second operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:53,613 INFO L93 Difference]: Finished difference Result 865 states and 1595 transitions. [2022-02-20 19:41:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1595 transitions. [2022-02-20 19:41:53,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:53,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:53,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 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 865 states. [2022-02-20 19:41:53,618 INFO L87 Difference]: Start difference. First operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 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 865 states. [2022-02-20 19:41:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:53,640 INFO L93 Difference]: Finished difference Result 865 states and 1595 transitions. [2022-02-20 19:41:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1595 transitions. [2022-02-20 19:41:53,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:53,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:53,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:53,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1594 transitions. [2022-02-20 19:41:53,665 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1594 transitions. Word has length 52 [2022-02-20 19:41:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:53,667 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1594 transitions. [2022-02-20 19:41:53,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1594 transitions. [2022-02-20 19:41:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:41:53,668 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:53,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:41:53,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:41:53,669 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1780734059, now seen corresponding path program 1 times [2022-02-20 19:41:53,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:53,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638107396] [2022-02-20 19:41:53,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:53,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:53,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {12274#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {12274#true} is VALID [2022-02-20 19:41:53,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {12274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {12274#true} is VALID [2022-02-20 19:41:53,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {12274#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12274#true} is VALID [2022-02-20 19:41:53,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {12274#true} assume 0 == ~r1~0; {12274#true} is VALID [2022-02-20 19:41:53,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {12274#true} assume ~id1~0 >= 0; {12274#true} is VALID [2022-02-20 19:41:53,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {12274#true} assume 0 == ~st1~0; {12274#true} is VALID [2022-02-20 19:41:53,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {12274#true} assume ~send1~0 == ~id1~0; {12274#true} is VALID [2022-02-20 19:41:53,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {12274#true} assume 0 == ~mode1~0 % 256; {12274#true} is VALID [2022-02-20 19:41:53,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {12274#true} assume ~id2~0 >= 0; {12274#true} is VALID [2022-02-20 19:41:53,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {12274#true} assume 0 == ~st2~0; {12274#true} is VALID [2022-02-20 19:41:53,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {12274#true} assume ~send2~0 == ~id2~0; {12274#true} is VALID [2022-02-20 19:41:53,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {12274#true} assume 0 == ~mode2~0 % 256; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {12276#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 8);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; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {12276#(= (+ (* (- 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; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {12276#(= (+ (* (- 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; {12276#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:41:53,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {12276#(= (+ (* (- 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; {12275#false} is VALID [2022-02-20 19:41:53,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {12275#false} assume !(node2_~m2~0#1 != ~nomsg~0); {12275#false} is VALID [2022-02-20 19:41:53,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {12275#false} ~mode2~0 := 0; {12275#false} is VALID [2022-02-20 19:41:53,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {12275#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; {12275#false} is VALID [2022-02-20 19:41:53,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {12275#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12275#false} is VALID [2022-02-20 19:41:53,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {12275#false} assume !(node3_~m3~0#1 != ~nomsg~0); {12275#false} is VALID [2022-02-20 19:41:53,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {12275#false} ~mode3~0 := 0; {12275#false} is VALID [2022-02-20 19:41:53,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {12275#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12275#false} is VALID [2022-02-20 19:41:53,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {12275#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12275#false} is VALID [2022-02-20 19:41:53,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {12275#false} assume !(node4_~m4~0#1 != ~nomsg~0); {12275#false} is VALID [2022-02-20 19:41:53,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {12275#false} ~mode4~0 := 0; {12275#false} is VALID [2022-02-20 19:41:53,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {12275#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12275#false} is VALID [2022-02-20 19:41:53,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {12275#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {12275#false} is VALID [2022-02-20 19:41:53,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {12275#false} check_#res#1 := check_~tmp~1#1; {12275#false} is VALID [2022-02-20 19:41:53,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {12275#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {12275#false} is VALID [2022-02-20 19:41:53,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {12275#false} assume 0 == assert_~arg#1 % 256; {12275#false} is VALID [2022-02-20 19:41:53,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {12275#false} assume !false; {12275#false} is VALID [2022-02-20 19:41:53,759 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:41:53,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:53,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638107396] [2022-02-20 19:41:53,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638107396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:53,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:53,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:41:53,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729065308] [2022-02-20 19:41:53,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:41:53,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:53,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:53,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:53,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:41:53,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:41:53,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:41:53,797 INFO L87 Difference]: Start difference. First operand 863 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:55,383 INFO L93 Difference]: Finished difference Result 1011 states and 1826 transitions. [2022-02-20 19:41:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:41:55,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:41:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:41:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:41:55,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:41:56,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:56,788 INFO L225 Difference]: With dead ends: 1011 [2022-02-20 19:41:56,788 INFO L226 Difference]: Without dead ends: 931 [2022-02-20 19:41:56,789 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:41:56,789 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 1494 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1658 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:41:56,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 1658 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-02-20 19:41:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2022-02-20 19:41:56,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:56,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 931 states. Second operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:56,803 INFO L74 IsIncluded]: Start isIncluded. First operand 931 states. Second operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:56,804 INFO L87 Difference]: Start difference. First operand 931 states. Second operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:56,829 INFO L93 Difference]: Finished difference Result 931 states and 1698 transitions. [2022-02-20 19:41:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1698 transitions. [2022-02-20 19:41:56,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:56,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:56,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 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 931 states. [2022-02-20 19:41:56,833 INFO L87 Difference]: Start difference. First operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 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 931 states. [2022-02-20 19:41:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:56,858 INFO L93 Difference]: Finished difference Result 931 states and 1698 transitions. [2022-02-20 19:41:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1698 transitions. [2022-02-20 19:41:56,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:56,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:56,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:56,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1697 transitions. [2022-02-20 19:41:56,888 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1697 transitions. Word has length 52 [2022-02-20 19:41:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:56,888 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1697 transitions. [2022-02-20 19:41:56,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1697 transitions. [2022-02-20 19:41:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:41:56,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:56,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:41:56,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:41:56,890 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash 919948555, now seen corresponding path program 1 times [2022-02-20 19:41:56,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:56,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829097792] [2022-02-20 19:41:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:56,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {16163#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {16163#true} is VALID [2022-02-20 19:41:56,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {16163#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {16163#true} is VALID [2022-02-20 19:41:56,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {16163#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16163#true} is VALID [2022-02-20 19:41:56,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {16163#true} assume 0 == ~r1~0; {16163#true} is VALID [2022-02-20 19:41:56,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {16163#true} assume ~id1~0 >= 0; {16163#true} is VALID [2022-02-20 19:41:56,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {16163#true} assume 0 == ~st1~0; {16163#true} is VALID [2022-02-20 19:41:56,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {16163#true} assume ~send1~0 == ~id1~0; {16163#true} is VALID [2022-02-20 19:41:56,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {16163#true} assume 0 == ~mode1~0 % 256; {16163#true} is VALID [2022-02-20 19:41:56,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {16163#true} assume ~id2~0 >= 0; {16163#true} is VALID [2022-02-20 19:41:56,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {16163#true} assume 0 == ~st2~0; {16163#true} is VALID [2022-02-20 19:41:56,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {16163#true} assume ~send2~0 == ~id2~0; {16163#true} is VALID [2022-02-20 19:41:56,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {16163#true} assume 0 == ~mode2~0 % 256; {16163#true} is VALID [2022-02-20 19:41:56,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {16163#true} assume ~id3~0 >= 0; {16163#true} is VALID [2022-02-20 19:41:56,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {16163#true} assume 0 == ~st3~0; {16163#true} is VALID [2022-02-20 19:41:56,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {16163#true} assume ~send3~0 == ~id3~0; {16163#true} is VALID [2022-02-20 19:41:56,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {16163#true} assume 0 == ~mode3~0 % 256; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {16165#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 8);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; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {16165#(= (+ (* (- 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; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {16165#(= (+ (* (- 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; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {16165#(= (+ (* (- 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; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {16165#(= (+ (* (- 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; {16165#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:41:56,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {16165#(= (+ (* (- 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; {16164#false} is VALID [2022-02-20 19:41:56,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {16164#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16164#false} is VALID [2022-02-20 19:41:56,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {16164#false} ~mode3~0 := 0; {16164#false} is VALID [2022-02-20 19:41:56,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {16164#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {16164#false} is VALID [2022-02-20 19:41:56,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {16164#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16164#false} is VALID [2022-02-20 19:41:56,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {16164#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16164#false} is VALID [2022-02-20 19:41:56,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {16164#false} ~mode4~0 := 0; {16164#false} is VALID [2022-02-20 19:41:56,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {16164#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16164#false} is VALID [2022-02-20 19:41:56,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {16164#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {16164#false} is VALID [2022-02-20 19:41:56,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {16164#false} check_#res#1 := check_~tmp~1#1; {16164#false} is VALID [2022-02-20 19:41:56,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {16164#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {16164#false} is VALID [2022-02-20 19:41:56,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {16164#false} assume 0 == assert_~arg#1 % 256; {16164#false} is VALID [2022-02-20 19:41:56,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {16164#false} assume !false; {16164#false} is VALID [2022-02-20 19:41:56,981 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:41:56,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:56,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829097792] [2022-02-20 19:41:56,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829097792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:56,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:56,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:41:56,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130785153] [2022-02-20 19:41:56,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:56,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:41:56,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:56,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:57,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:41:57,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:57,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:41:57,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:41:57,008 INFO L87 Difference]: Start difference. First operand 929 states and 1697 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:58,753 INFO L93 Difference]: Finished difference Result 1197 states and 2115 transitions. [2022-02-20 19:41:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:41:58,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:41:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:41:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:41:58,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:00,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:00,234 INFO L225 Difference]: With dead ends: 1197 [2022-02-20 19:42:00,234 INFO L226 Difference]: Without dead ends: 1051 [2022-02-20 19:42:00,235 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:42:00,235 INFO L933 BasicCegarLoop]: 1582 mSDtfsCounter, 1490 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1657 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:42:00,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 1657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2022-02-20 19:42:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1049. [2022-02-20 19:42:00,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:00,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1051 states. Second operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:00,251 INFO L74 IsIncluded]: Start isIncluded. First operand 1051 states. Second operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:00,252 INFO L87 Difference]: Start difference. First operand 1051 states. Second operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:00,281 INFO L93 Difference]: Finished difference Result 1051 states and 1882 transitions. [2022-02-20 19:42:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1882 transitions. [2022-02-20 19:42:00,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:00,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:00,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 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 1051 states. [2022-02-20 19:42:00,285 INFO L87 Difference]: Start difference. First operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 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 1051 states. [2022-02-20 19:42:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:00,314 INFO L93 Difference]: Finished difference Result 1051 states and 1882 transitions. [2022-02-20 19:42:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1882 transitions. [2022-02-20 19:42:00,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:00,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:00,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:00,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1881 transitions. [2022-02-20 19:42:00,348 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1881 transitions. Word has length 52 [2022-02-20 19:42:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:00,348 INFO L470 AbstractCegarLoop]: Abstraction has 1049 states and 1881 transitions. [2022-02-20 19:42:00,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1881 transitions. [2022-02-20 19:42:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:00,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:00,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:00,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:42:00,349 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1515907135, now seen corresponding path program 1 times [2022-02-20 19:42:00,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:00,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687344143] [2022-02-20 19:42:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:00,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {20668#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {20668#true} is VALID [2022-02-20 19:42:00,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {20668#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {20668#true} is VALID [2022-02-20 19:42:00,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {20668#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20668#true} is VALID [2022-02-20 19:42:00,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {20668#true} assume 0 == ~r1~0; {20668#true} is VALID [2022-02-20 19:42:00,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {20668#true} assume ~id1~0 >= 0; {20668#true} is VALID [2022-02-20 19:42:00,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {20668#true} assume 0 == ~st1~0; {20668#true} is VALID [2022-02-20 19:42:00,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {20668#true} assume ~send1~0 == ~id1~0; {20668#true} is VALID [2022-02-20 19:42:00,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {20668#true} assume 0 == ~mode1~0 % 256; {20668#true} is VALID [2022-02-20 19:42:00,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {20668#true} assume ~id2~0 >= 0; {20668#true} is VALID [2022-02-20 19:42:00,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {20668#true} assume 0 == ~st2~0; {20668#true} is VALID [2022-02-20 19:42:00,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {20668#true} assume ~send2~0 == ~id2~0; {20668#true} is VALID [2022-02-20 19:42:00,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {20668#true} assume 0 == ~mode2~0 % 256; {20668#true} is VALID [2022-02-20 19:42:00,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {20668#true} assume ~id3~0 >= 0; {20668#true} is VALID [2022-02-20 19:42:00,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {20668#true} assume 0 == ~st3~0; {20668#true} is VALID [2022-02-20 19:42:00,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {20668#true} assume ~send3~0 == ~id3~0; {20668#true} is VALID [2022-02-20 19:42:00,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {20668#true} assume 0 == ~mode3~0 % 256; {20668#true} is VALID [2022-02-20 19:42:00,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {20668#true} assume ~id4~0 >= 0; {20668#true} is VALID [2022-02-20 19:42:00,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {20668#true} assume 0 == ~st4~0; {20668#true} is VALID [2022-02-20 19:42:00,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {20668#true} assume ~send4~0 == ~id4~0; {20668#true} is VALID [2022-02-20 19:42:00,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {20668#true} assume 0 == ~mode4~0 % 256; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == main1_~i2~0#1); {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 8);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; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:00,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {20670#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20669#false} is VALID [2022-02-20 19:42:00,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {20669#false} assume !(node4_~m4~0#1 != ~nomsg~0); {20669#false} is VALID [2022-02-20 19:42:00,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {20669#false} ~mode4~0 := 0; {20669#false} is VALID [2022-02-20 19:42:00,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {20669#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {20669#false} is VALID [2022-02-20 19:42:00,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {20669#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {20669#false} is VALID [2022-02-20 19:42:00,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {20669#false} check_#res#1 := check_~tmp~1#1; {20669#false} is VALID [2022-02-20 19:42:00,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {20669#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {20669#false} is VALID [2022-02-20 19:42:00,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {20669#false} assume 0 == assert_~arg#1 % 256; {20669#false} is VALID [2022-02-20 19:42:00,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {20669#false} assume !false; {20669#false} is VALID [2022-02-20 19:42:00,453 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:42:00,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:00,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687344143] [2022-02-20 19:42:00,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687344143] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:00,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:00,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:00,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813469015] [2022-02-20 19:42:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:00,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:00,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:00,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:00,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:00,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:00,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:00,485 INFO L87 Difference]: Start difference. First operand 1049 states and 1881 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:02,367 INFO L93 Difference]: Finished difference Result 1533 states and 2627 transitions. [2022-02-20 19:42:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:02,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:02,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:03,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:03,718 INFO L225 Difference]: With dead ends: 1533 [2022-02-20 19:42:03,718 INFO L226 Difference]: Without dead ends: 1267 [2022-02-20 19:42:03,719 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:42:03,720 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1486 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1656 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:42:03,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 1656 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-02-20 19:42:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1265. [2022-02-20 19:42:03,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:03,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1267 states. Second operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,746 INFO L74 IsIncluded]: Start isIncluded. First operand 1267 states. Second operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,747 INFO L87 Difference]: Start difference. First operand 1267 states. Second operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:03,788 INFO L93 Difference]: Finished difference Result 1267 states and 2206 transitions. [2022-02-20 19:42:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2206 transitions. [2022-02-20 19:42:03,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:03,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:03,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 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 1267 states. [2022-02-20 19:42:03,792 INFO L87 Difference]: Start difference. First operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 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 1267 states. [2022-02-20 19:42:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:03,835 INFO L93 Difference]: Finished difference Result 1267 states and 2206 transitions. [2022-02-20 19:42:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2206 transitions. [2022-02-20 19:42:03,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:03,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:03,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:03,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2205 transitions. [2022-02-20 19:42:03,884 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2205 transitions. Word has length 52 [2022-02-20 19:42:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:03,885 INFO L470 AbstractCegarLoop]: Abstraction has 1265 states and 2205 transitions. [2022-02-20 19:42:03,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2205 transitions. [2022-02-20 19:42:03,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:03,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:03,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:03,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:42:03,886 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1924545907, now seen corresponding path program 1 times [2022-02-20 19:42:03,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:03,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763853187] [2022-02-20 19:42:03,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:03,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {26297#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {26297#true} is VALID [2022-02-20 19:42:03,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {26297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {26297#true} is VALID [2022-02-20 19:42:03,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {26297#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {26297#true} is VALID [2022-02-20 19:42:03,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {26297#true} assume 0 == ~r1~0; {26297#true} is VALID [2022-02-20 19:42:03,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {26297#true} assume ~id1~0 >= 0; {26297#true} is VALID [2022-02-20 19:42:03,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {26297#true} assume 0 == ~st1~0; {26299#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:03,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {26299#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {26299#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:03,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {26299#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {26299#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:03,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {26299#(<= ~st1~0 0)} assume ~id2~0 >= 0; {26299#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:03,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {26299#(<= ~st1~0 0)} assume 0 == ~st2~0; {26300#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {26300#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {26300#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {26300#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {26300#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {26300#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {26300#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {26300#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {26301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {26301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {26301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {26301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {26301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {26301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {26301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {26301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {26302#(<= (+ ~st4~0 ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 8);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; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {26302#(<= (+ ~st4~0 ~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; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {26302#(<= (+ ~st4~0 ~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; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {26302#(<= (+ ~st4~0 ~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; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {26302#(<= (+ ~st4~0 ~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; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {26302#(<= (+ ~st4~0 ~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; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:03,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {26302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {26298#false} is VALID [2022-02-20 19:42:03,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {26298#false} check_#res#1 := check_~tmp~1#1; {26298#false} is VALID [2022-02-20 19:42:03,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {26298#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {26298#false} is VALID [2022-02-20 19:42:03,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {26298#false} assume 0 == assert_~arg#1 % 256; {26298#false} is VALID [2022-02-20 19:42:03,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {26298#false} assume !false; {26298#false} is VALID [2022-02-20 19:42:03,990 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:42:03,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:03,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763853187] [2022-02-20 19:42:03,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763853187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:03,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:03,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:42:03,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792560015] [2022-02-20 19:42:03,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:03,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:03,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:03,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:04,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:04,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:04,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:04,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:04,026 INFO L87 Difference]: Start difference. First operand 1265 states and 2205 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:08,463 INFO L93 Difference]: Finished difference Result 5121 states and 8101 transitions. [2022-02-20 19:42:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:42:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:42:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:42:08,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2089 transitions. [2022-02-20 19:42:10,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2089 edges. 2089 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:10,860 INFO L225 Difference]: With dead ends: 5121 [2022-02-20 19:42:10,861 INFO L226 Difference]: Without dead ends: 4639 [2022-02-20 19:42:10,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:42:10,862 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 6521 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6521 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:10,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6521 Valid, 2068 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2022-02-20 19:42:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 1745. [2022-02-20 19:42:11,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:11,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4639 states. Second operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:11,202 INFO L74 IsIncluded]: Start isIncluded. First operand 4639 states. Second operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:11,203 INFO L87 Difference]: Start difference. First operand 4639 states. Second operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:11,725 INFO L93 Difference]: Finished difference Result 4639 states and 7236 transitions. [2022-02-20 19:42:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 7236 transitions. [2022-02-20 19:42:11,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:11,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:11,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 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 4639 states. [2022-02-20 19:42:11,733 INFO L87 Difference]: Start difference. First operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 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 4639 states. [2022-02-20 19:42:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:12,266 INFO L93 Difference]: Finished difference Result 4639 states and 7236 transitions. [2022-02-20 19:42:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 7236 transitions. [2022-02-20 19:42:12,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:12,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:12,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:12,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2909 transitions. [2022-02-20 19:42:12,374 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2909 transitions. Word has length 52 [2022-02-20 19:42:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:12,374 INFO L470 AbstractCegarLoop]: Abstraction has 1745 states and 2909 transitions. [2022-02-20 19:42:12,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2909 transitions. [2022-02-20 19:42:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:12,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:12,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:12,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:42:12,376 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1236981091, now seen corresponding path program 1 times [2022-02-20 19:42:12,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:12,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223488747] [2022-02-20 19:42:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:12,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {43704#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {43704#true} is VALID [2022-02-20 19:42:12,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {43704#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {43704#true} is VALID [2022-02-20 19:42:12,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {43704#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {43704#true} is VALID [2022-02-20 19:42:12,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {43704#true} assume 0 == ~r1~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {43706#(<= ~r1~0 0)} assume ~id1~0 >= 0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {43706#(<= ~r1~0 0)} assume 0 == ~st1~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {43706#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {43706#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {43706#(<= ~r1~0 0)} assume ~id2~0 >= 0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {43706#(<= ~r1~0 0)} assume 0 == ~st2~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {43706#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {43706#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {43706#(<= ~r1~0 0)} assume ~id3~0 >= 0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {43706#(<= ~r1~0 0)} assume 0 == ~st3~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {43706#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {43706#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {43706#(<= ~r1~0 0)} assume ~id4~0 >= 0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {43706#(<= ~r1~0 0)} assume 0 == ~st4~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {43706#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {43706#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {43706#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {43706#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {43706#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {43706#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {43706#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {43706#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {43706#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {43706#(<= ~r1~0 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {43706#(<= ~r1~0 0)} assume !(0 == main1_~i2~0#1); {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {43706#(<= ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {43706#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 8);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; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {43706#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {43706#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {43706#(<= ~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; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {43706#(<= ~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; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {43706#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {43706#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {43706#(<= ~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; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {43706#(<= ~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; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {43706#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {43706#(<= ~r1~0 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {43706#(<= ~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; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {43706#(<= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {43706#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {43706#(<= ~r1~0 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {43706#(<= ~r1~0 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {43706#(<= ~r1~0 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {43706#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {43706#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:12,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {43706#(<= ~r1~0 0)} assume ~r1~0 >= 4; {43705#false} is VALID [2022-02-20 19:42:12,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {43705#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {43705#false} is VALID [2022-02-20 19:42:12,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {43705#false} check_#res#1 := check_~tmp~1#1; {43705#false} is VALID [2022-02-20 19:42:12,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {43705#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {43705#false} is VALID [2022-02-20 19:42:12,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {43705#false} assume 0 == assert_~arg#1 % 256; {43705#false} is VALID [2022-02-20 19:42:12,447 INFO L290 TraceCheckUtils]: 53: Hoare triple {43705#false} assume !false; {43705#false} is VALID [2022-02-20 19:42:12,447 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:42:12,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:12,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223488747] [2022-02-20 19:42:12,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223488747] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:12,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:12,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:12,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603273873] [2022-02-20 19:42:12,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:12,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:12,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:12,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:12,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:12,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:12,502 INFO L87 Difference]: Start difference. First operand 1745 states and 2909 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:14,809 INFO L93 Difference]: Finished difference Result 3151 states and 5009 transitions. [2022-02-20 19:42:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:14,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1666 transitions. [2022-02-20 19:42:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1666 transitions. [2022-02-20 19:42:14,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1666 transitions. [2022-02-20 19:42:16,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1666 edges. 1666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:16,276 INFO L225 Difference]: With dead ends: 3151 [2022-02-20 19:42:16,277 INFO L226 Difference]: Without dead ends: 2189 [2022-02-20 19:42:16,292 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:42:16,293 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1478 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1623 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:42:16,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 1623 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2022-02-20 19:42:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2187. [2022-02-20 19:42:16,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:16,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:16,986 INFO L74 IsIncluded]: Start isIncluded. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:16,988 INFO L87 Difference]: Start difference. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:17,141 INFO L93 Difference]: Finished difference Result 2189 states and 3544 transitions. [2022-02-20 19:42:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3544 transitions. [2022-02-20 19:42:17,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:17,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:17,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 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 2189 states. [2022-02-20 19:42:17,150 INFO L87 Difference]: Start difference. First operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 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 2189 states. [2022-02-20 19:42:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:17,359 INFO L93 Difference]: Finished difference Result 2189 states and 3544 transitions. [2022-02-20 19:42:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3544 transitions. [2022-02-20 19:42:17,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:17,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:17,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:17,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3543 transitions. [2022-02-20 19:42:17,516 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3543 transitions. Word has length 54 [2022-02-20 19:42:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:17,516 INFO L470 AbstractCegarLoop]: Abstraction has 2187 states and 3543 transitions. [2022-02-20 19:42:17,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3543 transitions. [2022-02-20 19:42:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:17,517 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:17,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:17,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:42:17,517 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1303474603, now seen corresponding path program 1 times [2022-02-20 19:42:17,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:17,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810881874] [2022-02-20 19:42:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:17,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {54319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {54319#true} is VALID [2022-02-20 19:42:17,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {54319#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {54319#true} is VALID [2022-02-20 19:42:17,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {54319#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {54319#true} is VALID [2022-02-20 19:42:17,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {54319#true} assume 0 == ~r1~0; {54319#true} is VALID [2022-02-20 19:42:17,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {54319#true} assume ~id1~0 >= 0; {54319#true} is VALID [2022-02-20 19:42:17,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {54319#true} assume 0 == ~st1~0; {54321#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:42:17,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {54321#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {54321#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:42:17,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {54321#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {54321#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:42:17,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {54321#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {54321#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:42:17,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {54321#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {54322#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:42:17,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {54322#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {54322#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:42:17,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {54322#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {54322#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:42:17,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {54322#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {54322#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:42:17,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {54322#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {54323#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:42:17,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {54323#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {54323#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:42:17,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {54323#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {54323#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:42:17,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {54323#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {54323#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:42:17,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {54323#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == main1_~i2~0#1); {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(main1_~i2~0#1 < 8);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; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:42:17,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {54324#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {54320#false} is VALID [2022-02-20 19:42:17,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {54320#false} check_#res#1 := check_~tmp~1#1; {54320#false} is VALID [2022-02-20 19:42:17,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {54320#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {54320#false} is VALID [2022-02-20 19:42:17,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {54320#false} assume 0 == assert_~arg#1 % 256; {54320#false} is VALID [2022-02-20 19:42:17,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {54320#false} assume !false; {54320#false} is VALID [2022-02-20 19:42:17,684 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:42:17,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:17,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810881874] [2022-02-20 19:42:17,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810881874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:17,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:17,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:42:17,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088862746] [2022-02-20 19:42:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:17,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:17,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:17,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:17,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:17,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:17,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:17,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:17,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:17,723 INFO L87 Difference]: Start difference. First operand 2187 states and 3543 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:20,638 INFO L93 Difference]: Finished difference Result 3591 states and 5617 transitions. [2022-02-20 19:42:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:42:20,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:42:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2022-02-20 19:42:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2022-02-20 19:42:20,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1673 transitions. [2022-02-20 19:42:22,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1673 edges. 1673 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:22,264 INFO L225 Difference]: With dead ends: 3591 [2022-02-20 19:42:22,265 INFO L226 Difference]: Without dead ends: 2189 [2022-02-20 19:42:22,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:42:22,268 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 1590 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:22,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1590 Valid, 1793 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2022-02-20 19:42:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2187. [2022-02-20 19:42:22,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:22,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:22,890 INFO L74 IsIncluded]: Start isIncluded. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:22,891 INFO L87 Difference]: Start difference. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:23,006 INFO L93 Difference]: Finished difference Result 2189 states and 3520 transitions. [2022-02-20 19:42:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3520 transitions. [2022-02-20 19:42:23,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:23,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:23,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 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 2189 states. [2022-02-20 19:42:23,011 INFO L87 Difference]: Start difference. First operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 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 2189 states. [2022-02-20 19:42:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:23,126 INFO L93 Difference]: Finished difference Result 2189 states and 3520 transitions. [2022-02-20 19:42:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3520 transitions. [2022-02-20 19:42:23,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:23,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:23,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:23,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3519 transitions. [2022-02-20 19:42:23,270 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3519 transitions. Word has length 54 [2022-02-20 19:42:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:23,271 INFO L470 AbstractCegarLoop]: Abstraction has 2187 states and 3519 transitions. [2022-02-20 19:42:23,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3519 transitions. [2022-02-20 19:42:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:42:23,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:23,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:23,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:42:23,272 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1338283904, now seen corresponding path program 1 times [2022-02-20 19:42:23,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:23,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106329218] [2022-02-20 19:42:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:23,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {65485#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {65487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:23,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {65487#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {65488#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 19:42:23,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {65488#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {65488#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 19:42:23,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {65488#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} init_#res#1 := init_~tmp~0#1; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == main1_~i2~0#1); {65489#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:23,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {65489#(<= (+ ~nomsg~0 1) ~send4~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !!(main1_~i2~0#1 < 8);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; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode1~0 % 256); {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode2~0 % 256); {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode3~0 % 256); {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode4~0 % 256); {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:23,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {65490#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {65486#false} is VALID [2022-02-20 19:42:23,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {65486#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {65486#false} is VALID [2022-02-20 19:42:23,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {65486#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {65486#false} is VALID [2022-02-20 19:42:23,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {65486#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {65486#false} is VALID [2022-02-20 19:42:23,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {65486#false} assume !(~r1~0 >= 4); {65486#false} is VALID [2022-02-20 19:42:23,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {65486#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {65486#false} is VALID [2022-02-20 19:42:23,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {65486#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {65486#false} is VALID [2022-02-20 19:42:23,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {65486#false} check_#res#1 := check_~tmp~1#1; {65486#false} is VALID [2022-02-20 19:42:23,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {65486#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {65486#false} is VALID [2022-02-20 19:42:23,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {65486#false} assume 0 == assert_~arg#1 % 256; {65486#false} is VALID [2022-02-20 19:42:23,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {65486#false} assume !false; {65486#false} is VALID [2022-02-20 19:42:23,347 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:42:23,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:23,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106329218] [2022-02-20 19:42:23,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106329218] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:23,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:23,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:42:23,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742667733] [2022-02-20 19:42:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:42:23,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:23,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:23,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:23,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:23,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:23,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:23,380 INFO L87 Difference]: Start difference. First operand 2187 states and 3519 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:27,890 INFO L93 Difference]: Finished difference Result 3589 states and 5568 transitions. [2022-02-20 19:42:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:42:27,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:42:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2022-02-20 19:42:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2022-02-20 19:42:27,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1607 transitions. [2022-02-20 19:42:28,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1607 edges. 1607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:29,074 INFO L225 Difference]: With dead ends: 3589 [2022-02-20 19:42:29,074 INFO L226 Difference]: Without dead ends: 2187 [2022-02-20 19:42:29,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:42:29,097 INFO L933 BasicCegarLoop]: 1503 mSDtfsCounter, 4543 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4543 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:29,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4543 Valid, 2992 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2022-02-20 19:42:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2187. [2022-02-20 19:42:30,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:30,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2187 states. Second operand has 2187 states, 2185 states have (on average 1.59954233409611) internal successors, (3495), 2186 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:30,441 INFO L74 IsIncluded]: Start isIncluded. First operand 2187 states. Second operand has 2187 states, 2185 states have (on average 1.59954233409611) internal successors, (3495), 2186 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:30,443 INFO L87 Difference]: Start difference. First operand 2187 states. Second operand has 2187 states, 2185 states have (on average 1.59954233409611) internal successors, (3495), 2186 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:30,567 INFO L93 Difference]: Finished difference Result 2187 states and 3495 transitions. [2022-02-20 19:42:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3495 transitions. [2022-02-20 19:42:30,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:30,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:30,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 2187 states, 2185 states have (on average 1.59954233409611) internal successors, (3495), 2186 states have internal predecessors, (3495), 0 states have call successors, (0), 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 2187 states. [2022-02-20 19:42:30,573 INFO L87 Difference]: Start difference. First operand has 2187 states, 2185 states have (on average 1.59954233409611) internal successors, (3495), 2186 states have internal predecessors, (3495), 0 states have call successors, (0), 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 2187 states. [2022-02-20 19:42:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:30,700 INFO L93 Difference]: Finished difference Result 2187 states and 3495 transitions. [2022-02-20 19:42:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3495 transitions. [2022-02-20 19:42:30,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:30,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:30,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:30,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.59954233409611) internal successors, (3495), 2186 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3495 transitions. [2022-02-20 19:42:30,869 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3495 transitions. Word has length 55 [2022-02-20 19:42:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:30,869 INFO L470 AbstractCegarLoop]: Abstraction has 2187 states and 3495 transitions. [2022-02-20 19:42:30,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3495 transitions. [2022-02-20 19:42:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:42:30,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:30,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:30,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:42:30,870 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:30,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 637219326, now seen corresponding path program 1 times [2022-02-20 19:42:30,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:30,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548055767] [2022-02-20 19:42:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:30,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {76647#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {76649#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:30,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {76649#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {76650#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 19:42:30,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {76650#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {76650#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 19:42:30,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {76650#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} init_#res#1 := init_~tmp~0#1; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == main1_~i2~0#1); {76651#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 19:42:30,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {76651#(<= (+ ~nomsg~0 1) ~send3~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} assume !!(main1_~i2~0#1 < 8);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; {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} assume !(0 != ~mode1~0 % 256); {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~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; {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~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; {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} assume !(0 != ~mode2~0 % 256); {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~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; {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~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; {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} assume !(0 != ~mode3~0 % 256); {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} is VALID [2022-02-20 19:42:30,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {76652#(and (<= (+ ~nomsg~0 1) ~send3~0) (= (+ ~nomsg~0 (* (- 1) ~p3_new~0)) 0))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {76648#false} is VALID [2022-02-20 19:42:30,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {76648#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; {76648#false} is VALID [2022-02-20 19:42:30,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {76648#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {76648#false} is VALID [2022-02-20 19:42:30,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {76648#false} assume !(0 != ~mode4~0 % 256); {76648#false} is VALID [2022-02-20 19:42:30,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {76648#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {76648#false} is VALID [2022-02-20 19:42:30,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {76648#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {76648#false} is VALID [2022-02-20 19:42:30,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {76648#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76648#false} is VALID [2022-02-20 19:42:30,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {76648#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {76648#false} is VALID [2022-02-20 19:42:30,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {76648#false} assume !(~r1~0 >= 4); {76648#false} is VALID [2022-02-20 19:42:30,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {76648#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {76648#false} is VALID [2022-02-20 19:42:30,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {76648#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {76648#false} is VALID [2022-02-20 19:42:30,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {76648#false} check_#res#1 := check_~tmp~1#1; {76648#false} is VALID [2022-02-20 19:42:30,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {76648#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {76648#false} is VALID [2022-02-20 19:42:30,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {76648#false} assume 0 == assert_~arg#1 % 256; {76648#false} is VALID [2022-02-20 19:42:30,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {76648#false} assume !false; {76648#false} is VALID [2022-02-20 19:42:30,950 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:42:30,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:30,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548055767] [2022-02-20 19:42:30,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548055767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:30,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:30,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:42:30,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894812901] [2022-02-20 19:42:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:30,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:42:30,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:30,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:30,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:30,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:30,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:30,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:30,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:30,990 INFO L87 Difference]: Start difference. First operand 2187 states and 3495 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:35,643 INFO L93 Difference]: Finished difference Result 3589 states and 5520 transitions. [2022-02-20 19:42:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:42:35,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:42:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1617 transitions. [2022-02-20 19:42:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1617 transitions. [2022-02-20 19:42:35,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1617 transitions. [2022-02-20 19:42:37,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1617 edges. 1617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:37,173 INFO L225 Difference]: With dead ends: 3589 [2022-02-20 19:42:37,173 INFO L226 Difference]: Without dead ends: 2187 [2022-02-20 19:42:37,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:42:37,187 INFO L933 BasicCegarLoop]: 1505 mSDtfsCounter, 4576 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4576 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:37,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4576 Valid, 2993 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2022-02-20 19:42:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2187. [2022-02-20 19:42:38,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:38,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2187 states. Second operand has 2187 states, 2185 states have (on average 1.588558352402746) internal successors, (3471), 2186 states have internal predecessors, (3471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:38,405 INFO L74 IsIncluded]: Start isIncluded. First operand 2187 states. Second operand has 2187 states, 2185 states have (on average 1.588558352402746) internal successors, (3471), 2186 states have internal predecessors, (3471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:38,406 INFO L87 Difference]: Start difference. First operand 2187 states. Second operand has 2187 states, 2185 states have (on average 1.588558352402746) internal successors, (3471), 2186 states have internal predecessors, (3471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:38,526 INFO L93 Difference]: Finished difference Result 2187 states and 3471 transitions. [2022-02-20 19:42:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3471 transitions. [2022-02-20 19:42:38,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:38,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:38,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 2187 states, 2185 states have (on average 1.588558352402746) internal successors, (3471), 2186 states have internal predecessors, (3471), 0 states have call successors, (0), 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 2187 states. [2022-02-20 19:42:38,531 INFO L87 Difference]: Start difference. First operand has 2187 states, 2185 states have (on average 1.588558352402746) internal successors, (3471), 2186 states have internal predecessors, (3471), 0 states have call successors, (0), 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 2187 states. [2022-02-20 19:42:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:38,649 INFO L93 Difference]: Finished difference Result 2187 states and 3471 transitions. [2022-02-20 19:42:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3471 transitions. [2022-02-20 19:42:38,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:38,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:38,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:38,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.588558352402746) internal successors, (3471), 2186 states have internal predecessors, (3471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3471 transitions. [2022-02-20 19:42:38,795 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3471 transitions. Word has length 55 [2022-02-20 19:42:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:38,795 INFO L470 AbstractCegarLoop]: Abstraction has 2187 states and 3471 transitions. [2022-02-20 19:42:38,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3471 transitions. [2022-02-20 19:42:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:42:38,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:38,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:38,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:42:38,797 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1917083004, now seen corresponding path program 1 times [2022-02-20 19:42:38,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:38,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372602639] [2022-02-20 19:42:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:38,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {87809#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {87809#true} is VALID [2022-02-20 19:42:38,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {87809#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {87809#true} is VALID [2022-02-20 19:42:38,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {87809#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#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~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {87809#true} is VALID [2022-02-20 19:42:38,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {87809#true} assume 0 == ~r1~0; {87809#true} is VALID [2022-02-20 19:42:38,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {87809#true} assume ~id1~0 >= 0; {87809#true} is VALID [2022-02-20 19:42:38,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {87809#true} assume 0 == ~st1~0; {87809#true} is VALID [2022-02-20 19:42:38,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {87809#true} assume ~send1~0 == ~id1~0; {87809#true} is VALID [2022-02-20 19:42:38,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {87809#true} assume 0 == ~mode1~0 % 256; {87809#true} is VALID [2022-02-20 19:42:38,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {87809#true} assume ~id2~0 >= 0; {87809#true} is VALID [2022-02-20 19:42:38,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {87809#true} assume 0 == ~st2~0; {87809#true} is VALID [2022-02-20 19:42:38,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {87809#true} assume ~send2~0 == ~id2~0; {87809#true} is VALID [2022-02-20 19:42:38,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {87809#true} assume 0 == ~mode2~0 % 256; {87809#true} is VALID [2022-02-20 19:42:38,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {87809#true} assume ~id3~0 >= 0; {87809#true} is VALID [2022-02-20 19:42:38,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {87809#true} assume 0 == ~st3~0; {87809#true} is VALID [2022-02-20 19:42:38,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {87809#true} assume ~send3~0 == ~id3~0; {87809#true} is VALID [2022-02-20 19:42:38,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {87809#true} assume 0 == ~mode3~0 % 256; {87809#true} is VALID [2022-02-20 19:42:38,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {87809#true} assume ~id4~0 >= 0; {87809#true} is VALID [2022-02-20 19:42:38,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {87809#true} assume 0 == ~st4~0; {87809#true} is VALID [2022-02-20 19:42:38,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {87809#true} assume ~send4~0 == ~id4~0; {87809#true} is VALID [2022-02-20 19:42:38,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {87809#true} assume 0 == ~mode4~0 % 256; {87809#true} is VALID [2022-02-20 19:42:38,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {87809#true} assume ~id1~0 != ~id2~0; {87809#true} is VALID [2022-02-20 19:42:38,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {87809#true} assume ~id1~0 != ~id3~0; {87809#true} is VALID [2022-02-20 19:42:38,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {87809#true} assume ~id1~0 != ~id4~0; {87809#true} is VALID [2022-02-20 19:42:38,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {87809#true} assume ~id2~0 != ~id3~0; {87809#true} is VALID [2022-02-20 19:42:38,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {87809#true} assume ~id2~0 != ~id4~0; {87809#true} is VALID [2022-02-20 19:42:38,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {87809#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {87809#true} is VALID [2022-02-20 19:42:38,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {87809#true} init_#res#1 := init_~tmp~0#1; {87809#true} is VALID [2022-02-20 19:42:38,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {87809#true} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {87809#true} is VALID [2022-02-20 19:42:38,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {87809#true} assume !(0 == main1_~i2~0#1); {87809#true} is VALID [2022-02-20 19:42:38,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {87809#true} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {87809#true} is VALID [2022-02-20 19:42:38,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {87809#true} assume !!(main1_~i2~0#1 < 8);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; {87809#true} is VALID [2022-02-20 19:42:38,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {87809#true} assume !(0 != ~mode1~0 % 256); {87809#true} is VALID [2022-02-20 19:42:38,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {87809#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {87809#true} is VALID [2022-02-20 19:42:38,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {87809#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; {87809#true} is VALID [2022-02-20 19:42:38,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {87809#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; {87809#true} is VALID [2022-02-20 19:42:38,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {87809#true} assume !(0 != ~mode2~0 % 256); {87809#true} is VALID [2022-02-20 19:42:38,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {87809#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {87809#true} is VALID [2022-02-20 19:42:38,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {87809#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; {87809#true} is VALID [2022-02-20 19:42:38,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {87809#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; {87809#true} is VALID [2022-02-20 19:42:38,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {87809#true} assume !(0 != ~mode3~0 % 256); {87809#true} is VALID [2022-02-20 19:42:38,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {87809#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {87809#true} is VALID [2022-02-20 19:42:38,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {87809#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; {87809#true} is VALID [2022-02-20 19:42:38,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {87809#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {87809#true} is VALID [2022-02-20 19:42:38,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {87809#true} assume !(0 != ~mode4~0 % 256); {87809#true} is VALID [2022-02-20 19:42:38,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {87809#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {87809#true} is VALID [2022-02-20 19:42:38,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {87809#true} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {87809#true} is VALID [2022-02-20 19:42:38,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {87809#true} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {87809#true} is VALID [2022-02-20 19:42:38,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {87809#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {87809#true} is VALID [2022-02-20 19:42:38,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {87809#true} assume !(~r1~0 >= 4); {87809#true} is VALID [2022-02-20 19:42:38,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {87809#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {87809#true} is VALID [2022-02-20 19:42:38,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {87809#true} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {87811#(= |ULTIMATE.start_check_~tmp~1#1| 1)} is VALID [2022-02-20 19:42:38,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {87811#(= |ULTIMATE.start_check_~tmp~1#1| 1)} check_#res#1 := check_~tmp~1#1; {87812#(= 1 |ULTIMATE.start_check_#res#1|)} is VALID [2022-02-20 19:42:38,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {87812#(= 1 |ULTIMATE.start_check_#res#1|)} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {87813#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:42:38,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {87813#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {87810#false} is VALID [2022-02-20 19:42:38,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {87810#false} assume !false; {87810#false} is VALID [2022-02-20 19:42:38,892 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:42:38,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:38,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372602639] [2022-02-20 19:42:38,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372602639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:38,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:38,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:42:38,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448283322] [2022-02-20 19:42:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:38,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:42:38,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:38,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:38,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:38,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:42:38,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:42:38,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:42:38,933 INFO L87 Difference]: Start difference. First operand 2187 states and 3471 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)