./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.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 726c27beb485f609d605f0581621ddf01187954349267fe751f77dd8e4a5e6ab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:47:32,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:47:32,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:47:32,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:47:32,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:47:32,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:47:32,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:47:32,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:47:32,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:47:32,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:47:32,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:47:32,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:47:32,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:47:32,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:47:32,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:47:32,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:47:32,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:47:32,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:47:32,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:47:32,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:47:32,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:47:32,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:47:32,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:47:32,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:47:32,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:47:32,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:47:32,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:47:32,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:47:32,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:47:32,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:47:32,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:47:32,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:47:32,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:47:32,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:47:32,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:47:32,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:47:32,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:47:32,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:47:32,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:47:32,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:47:32,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:47:32,893 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:47:32,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:47:32,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:47:32,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:47:32,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:47:32,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:47:32,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:47:32,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:47:32,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:47:32,929 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:47:32,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:47:32,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:47:32,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:47:32,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:47:32,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:47:32,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:47:32,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:47:32,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:47:32,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:47:32,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:47:32,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:47:32,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:47:32,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:47:32,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:47:32,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:47:32,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:47:32,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:47:32,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:47:32,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:47:32,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:47:32,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:47:32,935 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:47:32,935 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:47:32,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:47:32,935 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 -> 726c27beb485f609d605f0581621ddf01187954349267fe751f77dd8e4a5e6ab [2022-02-20 19:47:33,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:47:33,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:47:33,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:47:33,219 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:47:33,220 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:47:33,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:47:33,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a228b3a0/4315ff0d80644b42acc09342467d5cf8/FLAG01bcceb7d [2022-02-20 19:47:34,042 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:47:34,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:47:34,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a228b3a0/4315ff0d80644b42acc09342467d5cf8/FLAG01bcceb7d [2022-02-20 19:47:34,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a228b3a0/4315ff0d80644b42acc09342467d5cf8 [2022-02-20 19:47:34,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:47:34,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:47:34,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:47:34,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:47:34,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:47:34,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:47:34" (1/1) ... [2022-02-20 19:47:34,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da6076b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:34, skipping insertion in model container [2022-02-20 19:47:34,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:47:34" (1/1) ... [2022-02-20 19:47:34,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:47:34,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:47:34,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c[15510,15523] [2022-02-20 19:47:34,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c[21065,21078] [2022-02-20 19:47:35,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:47:35,435 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:47:35,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c[15510,15523] [2022-02-20 19:47:35,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c[21065,21078] [2022-02-20 19:47:35,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:47:35,897 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:47:35,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35 WrapperNode [2022-02-20 19:47:35,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:47:35,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:47:35,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:47:35,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:47:35,906 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:47:35" (1/1) ... [2022-02-20 19:47:35,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,437 INFO L137 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5147 [2022-02-20 19:47:36,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:47:36,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:47:36,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:47:36,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:47:36,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:47:36,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:47:36,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:47:36,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:47:36,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (1/1) ... [2022-02-20 19:47:36,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:47:36,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:47:36,768 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:47:36,788 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:47:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:47:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:47:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:47:36,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:47:36,948 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:47:36,949 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:47:44,759 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:47:44,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:47:44,777 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:47:44,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:44 BoogieIcfgContainer [2022-02-20 19:47:44,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:47:44,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:47:44,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:47:44,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:47:44,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:47:34" (1/3) ... [2022-02-20 19:47:44,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bed62e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:44, skipping insertion in model container [2022-02-20 19:47:44,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:35" (2/3) ... [2022-02-20 19:47:44,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bed62e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:44, skipping insertion in model container [2022-02-20 19:47:44,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:44" (3/3) ... [2022-02-20 19:47:44,786 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:47:44,790 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:47:44,790 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:47:44,829 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:47:44,834 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:47:44,835 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:47:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 928 states, 925 states have (on average 1.8983783783783783) internal successors, (1756), 927 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:47:44,881 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:44,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:47:44,882 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash -321533933, now seen corresponding path program 1 times [2022-02-20 19:47:44,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:44,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746654983] [2022-02-20 19:47:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:45,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {931#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {931#true} is VALID [2022-02-20 19:47:45,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {931#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {931#true} is VALID [2022-02-20 19:47:45,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {931#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {931#true} is VALID [2022-02-20 19:47:45,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {931#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {931#true} is VALID [2022-02-20 19:47:45,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {931#true} init_#res#1 := init_~tmp~0#1; {931#true} is VALID [2022-02-20 19:47:45,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {931#true} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {931#true} is VALID [2022-02-20 19:47:45,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {931#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {932#false} is VALID [2022-02-20 19:47:45,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {932#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {932#false} is VALID [2022-02-20 19:47:45,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {932#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {932#false} assume !(0 != ~mode1~0 % 256); {932#false} is VALID [2022-02-20 19:47:45,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {932#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {932#false} is VALID [2022-02-20 19:47:45,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {932#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {932#false} is VALID [2022-02-20 19:47:45,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {932#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {932#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {932#false} assume !(node2_~m2~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:47:45,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {932#false} ~mode2~0 := 0; {932#false} is VALID [2022-02-20 19:47:45,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {932#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {932#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {932#false} assume !(node3_~m3~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:47:45,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {932#false} ~mode3~0 := 0; {932#false} is VALID [2022-02-20 19:47:45,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {932#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {932#false} assume !(node4_~m4~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:47:45,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {932#false} ~mode4~0 := 0; {932#false} is VALID [2022-02-20 19:47:45,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {932#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {932#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {932#false} assume !(node5_~m5~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:47:45,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {932#false} ~mode5~0 := 0; {932#false} is VALID [2022-02-20 19:47:45,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {932#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {932#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:47:45,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {932#false} assume !(node6_~m6~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:47:45,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {932#false} ~mode6~0 := 0; {932#false} is VALID [2022-02-20 19:47:45,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {932#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {932#false} is VALID [2022-02-20 19:47:45,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {932#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {932#false} is VALID [2022-02-20 19:47:45,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {932#false} check_#res#1 := check_~tmp~1#1; {932#false} is VALID [2022-02-20 19:47:45,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {932#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {932#false} is VALID [2022-02-20 19:47:45,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {932#false} assume 0 == assert_~arg#1 % 256; {932#false} is VALID [2022-02-20 19:47:45,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {932#false} assume !false; {932#false} is VALID [2022-02-20 19:47:45,103 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:47:45,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:45,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746654983] [2022-02-20 19:47:45,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746654983] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:45,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:45,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:47:45,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334086727] [2022-02-20 19:47:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 19:47:45,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:45,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:45,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:45,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:47:45,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:45,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:47:45,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:47:45,178 INFO L87 Difference]: Start difference. First operand has 928 states, 925 states have (on average 1.8983783783783783) internal successors, (1756), 927 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:46,717 INFO L93 Difference]: Finished difference Result 1808 states and 3422 transitions. [2022-02-20 19:47:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:47:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 19:47:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3422 transitions. [2022-02-20 19:47:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3422 transitions. [2022-02-20 19:47:46,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3422 transitions. [2022-02-20 19:47:49,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3422 edges. 3422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:49,600 INFO L225 Difference]: With dead ends: 1808 [2022-02-20 19:47:49,601 INFO L226 Difference]: Without dead ends: 862 [2022-02-20 19:47:49,606 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:47:49,609 INFO L933 BasicCegarLoop]: 1687 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:49,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-02-20 19:47:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-02-20 19:47:49,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:49,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:49,691 INFO L74 IsIncluded]: Start isIncluded. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:49,694 INFO L87 Difference]: Start difference. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:49,740 INFO L93 Difference]: Finished difference Result 862 states and 1623 transitions. [2022-02-20 19:47:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1623 transitions. [2022-02-20 19:47:49,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:49,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:49,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 862 states. [2022-02-20 19:47:49,754 INFO L87 Difference]: Start difference. First operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 862 states. [2022-02-20 19:47:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:49,797 INFO L93 Difference]: Finished difference Result 862 states and 1623 transitions. [2022-02-20 19:47:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1623 transitions. [2022-02-20 19:47:49,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:49,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:49,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:49,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1623 transitions. [2022-02-20 19:47:49,853 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1623 transitions. Word has length 38 [2022-02-20 19:47:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:49,854 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1623 transitions. [2022-02-20 19:47:49,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1623 transitions. [2022-02-20 19:47:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:47:49,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:49,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:47:49,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:47:49,857 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash -46774319, now seen corresponding path program 1 times [2022-02-20 19:47:49,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:49,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454106844] [2022-02-20 19:47:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:49,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {5376#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5376#true} is VALID [2022-02-20 19:47:49,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {5376#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {5376#true} is VALID [2022-02-20 19:47:49,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {5376#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5376#true} is VALID [2022-02-20 19:47:49,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {5376#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5378#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:47:49,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {5378#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5379#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:47:49,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {5379#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5380#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:47:49,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {5380#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5377#false} is VALID [2022-02-20 19:47:49,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {5377#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5377#false} is VALID [2022-02-20 19:47:49,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {5377#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {5377#false} assume !(0 != ~mode1~0 % 256); {5377#false} is VALID [2022-02-20 19:47:49,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {5377#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5377#false} is VALID [2022-02-20 19:47:49,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {5377#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {5377#false} is VALID [2022-02-20 19:47:49,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {5377#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {5377#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {5377#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:47:49,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {5377#false} ~mode2~0 := 0; {5377#false} is VALID [2022-02-20 19:47:49,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {5377#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {5377#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {5377#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:47:49,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {5377#false} ~mode3~0 := 0; {5377#false} is VALID [2022-02-20 19:47:49,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {5377#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {5377#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {5377#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:47:49,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {5377#false} ~mode4~0 := 0; {5377#false} is VALID [2022-02-20 19:47:49,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {5377#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {5377#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {5377#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:47:49,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {5377#false} ~mode5~0 := 0; {5377#false} is VALID [2022-02-20 19:47:49,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {5377#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {5377#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:47:49,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {5377#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:47:49,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {5377#false} ~mode6~0 := 0; {5377#false} is VALID [2022-02-20 19:47:49,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {5377#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5377#false} is VALID [2022-02-20 19:47:49,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {5377#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {5377#false} is VALID [2022-02-20 19:47:50,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {5377#false} check_#res#1 := check_~tmp~1#1; {5377#false} is VALID [2022-02-20 19:47:50,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {5377#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5377#false} is VALID [2022-02-20 19:47:50,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {5377#false} assume 0 == assert_~arg#1 % 256; {5377#false} is VALID [2022-02-20 19:47:50,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {5377#false} assume !false; {5377#false} is VALID [2022-02-20 19:47:50,001 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:47:50,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:50,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454106844] [2022-02-20 19:47:50,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454106844] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:50,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:50,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:47:50,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396546044] [2022-02-20 19:47:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:50,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 19:47:50,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:50,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:50,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:50,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:47:50,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:50,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:47:50,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:47:50,030 INFO L87 Difference]: Start difference. First operand 862 states and 1623 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:54,002 INFO L93 Difference]: Finished difference Result 928 states and 1725 transitions. [2022-02-20 19:47:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:47:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 19:47:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-02-20 19:47:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-02-20 19:47:54,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1725 transitions. [2022-02-20 19:47:55,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1725 edges. 1725 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:55,447 INFO L225 Difference]: With dead ends: 928 [2022-02-20 19:47:55,447 INFO L226 Difference]: Without dead ends: 862 [2022-02-20 19:47:55,448 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:47:55,449 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 3 mSDsluCounter, 4820 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6441 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:55,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6441 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-02-20 19:47:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-02-20 19:47:55,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:55,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:55,470 INFO L74 IsIncluded]: Start isIncluded. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:55,471 INFO L87 Difference]: Start difference. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:55,532 INFO L93 Difference]: Finished difference Result 862 states and 1583 transitions. [2022-02-20 19:47:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1583 transitions. [2022-02-20 19:47:55,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:55,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:55,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 862 states. [2022-02-20 19:47:55,538 INFO L87 Difference]: Start difference. First operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 862 states. [2022-02-20 19:47:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:55,578 INFO L93 Difference]: Finished difference Result 862 states and 1583 transitions. [2022-02-20 19:47:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1583 transitions. [2022-02-20 19:47:55,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:55,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:55,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:55,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1583 transitions. [2022-02-20 19:47:55,622 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1583 transitions. Word has length 38 [2022-02-20 19:47:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:55,626 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1583 transitions. [2022-02-20 19:47:55,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1583 transitions. [2022-02-20 19:47:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 19:47:55,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:55,629 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] [2022-02-20 19:47:55,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:47:55,630 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash 570674805, now seen corresponding path program 1 times [2022-02-20 19:47:55,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:55,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612512591] [2022-02-20 19:47:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:55,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {8941#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {8943#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {8943#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet52#1);havoc main_#t~nondet52#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet50#1, main2_#t~ret51#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {8943#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet50#1 && main2_#t~nondet50#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet50#1;havoc main2_#t~nondet50#1; {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {8943#(<= 15 ~a24~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret47#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {8943#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(<= 15 ~a24~0)} is VALID [2022-02-20 19:47:55,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {8943#(<= 15 ~a24~0)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {8942#false} is VALID [2022-02-20 19:47:55,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {8942#false} assume !false; {8942#false} is VALID [2022-02-20 19:47:55,850 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:47:55,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:55,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612512591] [2022-02-20 19:47:55,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612512591] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:55,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:55,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:47:55,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994823361] [2022-02-20 19:47:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:55,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:47:55,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:55,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:55,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:55,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:55,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:55,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:55,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:55,897 INFO L87 Difference]: Start difference. First operand 862 states and 1583 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:01,338 INFO L93 Difference]: Finished difference Result 2366 states and 4456 transitions. [2022-02-20 19:48:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:01,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:48:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4456 transitions. [2022-02-20 19:48:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4456 transitions. [2022-02-20 19:48:01,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4456 transitions. [2022-02-20 19:48:04,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4456 edges. 4456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:04,845 INFO L225 Difference]: With dead ends: 2366 [2022-02-20 19:48:04,845 INFO L226 Difference]: Without dead ends: 1613 [2022-02-20 19:48:04,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:04,847 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 914 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:04,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 572 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 19:48:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2022-02-20 19:48:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2022-02-20 19:48:04,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:04,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.6201117318435754) internal successors, (2610), 1612 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:04,881 INFO L74 IsIncluded]: Start isIncluded. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.6201117318435754) internal successors, (2610), 1612 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:04,883 INFO L87 Difference]: Start difference. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.6201117318435754) internal successors, (2610), 1612 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:04,973 INFO L93 Difference]: Finished difference Result 1613 states and 2610 transitions. [2022-02-20 19:48:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2610 transitions. [2022-02-20 19:48:04,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:04,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:04,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 1613 states, 1611 states have (on average 1.6201117318435754) internal successors, (2610), 1612 states have internal predecessors, (2610), 0 states have call successors, (0), 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 1613 states. [2022-02-20 19:48:04,981 INFO L87 Difference]: Start difference. First operand has 1613 states, 1611 states have (on average 1.6201117318435754) internal successors, (2610), 1612 states have internal predecessors, (2610), 0 states have call successors, (0), 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 1613 states. [2022-02-20 19:48:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:05,064 INFO L93 Difference]: Finished difference Result 1613 states and 2610 transitions. [2022-02-20 19:48:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2610 transitions. [2022-02-20 19:48:05,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:05,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:05,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:05,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1611 states have (on average 1.6201117318435754) internal successors, (2610), 1612 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2610 transitions. [2022-02-20 19:48:05,161 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2610 transitions. Word has length 48 [2022-02-20 19:48:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:05,161 INFO L470 AbstractCegarLoop]: Abstraction has 1613 states and 2610 transitions. [2022-02-20 19:48:05,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2610 transitions. [2022-02-20 19:48:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:05,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:05,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:48:05,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:48:05,163 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:05,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1531755293, now seen corresponding path program 1 times [2022-02-20 19:48:05,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:05,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966101477] [2022-02-20 19:48:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:05,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {16196#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {16196#true} is VALID [2022-02-20 19:48:05,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {16196#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {16196#true} is VALID [2022-02-20 19:48:05,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {16196#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16196#true} is VALID [2022-02-20 19:48:05,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {16196#true} assume 0 == ~r1~0 % 256; {16196#true} is VALID [2022-02-20 19:48:05,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {16196#true} assume ~id1~0 >= 0; {16196#true} is VALID [2022-02-20 19:48:05,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {16196#true} assume 0 == ~st1~0; {16196#true} is VALID [2022-02-20 19:48:05,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {16196#true} assume ~send1~0 == ~id1~0; {16196#true} is VALID [2022-02-20 19:48:05,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {16196#true} assume 0 == ~mode1~0 % 256; {16196#true} is VALID [2022-02-20 19:48:05,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {16196#true} assume ~id2~0 >= 0; {16196#true} is VALID [2022-02-20 19:48:05,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {16196#true} assume 0 == ~st2~0; {16196#true} is VALID [2022-02-20 19:48:05,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {16196#true} assume ~send2~0 == ~id2~0; {16196#true} is VALID [2022-02-20 19:48:05,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {16196#true} assume 0 == ~mode2~0 % 256; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,258 INFO L290 TraceCheckUtils]: 43: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {16198#(= (+ (* (- 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; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {16198#(= (+ (* (- 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; {16198#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:05,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {16198#(= (+ (* (- 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; {16197#false} is VALID [2022-02-20 19:48:05,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {16197#false} assume !(node2_~m2~0#1 != ~nomsg~0); {16197#false} is VALID [2022-02-20 19:48:05,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {16197#false} ~mode2~0 := 0; {16197#false} is VALID [2022-02-20 19:48:05,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {16197#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; {16197#false} is VALID [2022-02-20 19:48:05,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {16197#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16197#false} is VALID [2022-02-20 19:48:05,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {16197#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16197#false} is VALID [2022-02-20 19:48:05,263 INFO L290 TraceCheckUtils]: 58: Hoare triple {16197#false} ~mode3~0 := 0; {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {16197#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; {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {16197#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {16197#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {16197#false} ~mode4~0 := 0; {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 63: Hoare triple {16197#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {16197#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {16197#false} assume !(node5_~m5~0#1 != ~nomsg~0); {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {16197#false} ~mode5~0 := 0; {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 67: Hoare triple {16197#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {16197#false} is VALID [2022-02-20 19:48:05,264 INFO L290 TraceCheckUtils]: 68: Hoare triple {16197#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {16197#false} is VALID [2022-02-20 19:48:05,265 INFO L290 TraceCheckUtils]: 69: Hoare triple {16197#false} assume !(node6_~m6~0#1 != ~nomsg~0); {16197#false} is VALID [2022-02-20 19:48:05,265 INFO L290 TraceCheckUtils]: 70: Hoare triple {16197#false} ~mode6~0 := 0; {16197#false} is VALID [2022-02-20 19:48:05,265 INFO L290 TraceCheckUtils]: 71: Hoare triple {16197#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16197#false} is VALID [2022-02-20 19:48:05,265 INFO L290 TraceCheckUtils]: 72: Hoare triple {16197#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {16197#false} is VALID [2022-02-20 19:48:05,266 INFO L290 TraceCheckUtils]: 73: Hoare triple {16197#false} check_#res#1 := check_~tmp~1#1; {16197#false} is VALID [2022-02-20 19:48:05,266 INFO L290 TraceCheckUtils]: 74: Hoare triple {16197#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16197#false} is VALID [2022-02-20 19:48:05,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {16197#false} assume 0 == assert_~arg#1 % 256; {16197#false} is VALID [2022-02-20 19:48:05,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {16197#false} assume !false; {16197#false} is VALID [2022-02-20 19:48:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:48:05,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:05,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966101477] [2022-02-20 19:48:05,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966101477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:05,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:05,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:05,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250328098] [2022-02-20 19:48:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:05,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:05,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:05,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:05,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:05,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:05,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:05,329 INFO L87 Difference]: Start difference. First operand 1613 states and 2610 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:07,149 INFO L93 Difference]: Finished difference Result 1731 states and 2796 transitions. [2022-02-20 19:48:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:07,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:07,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:08,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:08,716 INFO L225 Difference]: With dead ends: 1731 [2022-02-20 19:48:08,716 INFO L226 Difference]: Without dead ends: 1669 [2022-02-20 19:48:08,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:08,718 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 1523 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:08,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1523 Valid, 1751 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:08,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2022-02-20 19:48:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2022-02-20 19:48:08,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:08,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.6192192192192192) internal successors, (2696), 1666 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:08,788 INFO L74 IsIncluded]: Start isIncluded. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.6192192192192192) internal successors, (2696), 1666 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:08,791 INFO L87 Difference]: Start difference. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.6192192192192192) internal successors, (2696), 1666 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:08,902 INFO L93 Difference]: Finished difference Result 1669 states and 2697 transitions. [2022-02-20 19:48:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2697 transitions. [2022-02-20 19:48:08,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:08,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:08,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 1667 states, 1665 states have (on average 1.6192192192192192) internal successors, (2696), 1666 states have internal predecessors, (2696), 0 states have call successors, (0), 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 1669 states. [2022-02-20 19:48:08,910 INFO L87 Difference]: Start difference. First operand has 1667 states, 1665 states have (on average 1.6192192192192192) internal successors, (2696), 1666 states have internal predecessors, (2696), 0 states have call successors, (0), 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 1669 states. [2022-02-20 19:48:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:09,001 INFO L93 Difference]: Finished difference Result 1669 states and 2697 transitions. [2022-02-20 19:48:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2697 transitions. [2022-02-20 19:48:09,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:09,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:09,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:09,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.6192192192192192) internal successors, (2696), 1666 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2696 transitions. [2022-02-20 19:48:09,102 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2696 transitions. Word has length 77 [2022-02-20 19:48:09,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:09,102 INFO L470 AbstractCegarLoop]: Abstraction has 1667 states and 2696 transitions. [2022-02-20 19:48:09,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2696 transitions. [2022-02-20 19:48:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:09,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:09,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:48:09,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:48:09,104 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash 786172563, now seen corresponding path program 1 times [2022-02-20 19:48:09,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:09,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867163675] [2022-02-20 19:48:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:09,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {23004#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {23004#true} is VALID [2022-02-20 19:48:09,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {23004#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {23004#true} is VALID [2022-02-20 19:48:09,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {23004#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {23004#true} is VALID [2022-02-20 19:48:09,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {23004#true} assume 0 == ~r1~0 % 256; {23004#true} is VALID [2022-02-20 19:48:09,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {23004#true} assume ~id1~0 >= 0; {23004#true} is VALID [2022-02-20 19:48:09,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {23004#true} assume 0 == ~st1~0; {23004#true} is VALID [2022-02-20 19:48:09,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {23004#true} assume ~send1~0 == ~id1~0; {23004#true} is VALID [2022-02-20 19:48:09,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {23004#true} assume 0 == ~mode1~0 % 256; {23004#true} is VALID [2022-02-20 19:48:09,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {23004#true} assume ~id2~0 >= 0; {23004#true} is VALID [2022-02-20 19:48:09,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {23004#true} assume 0 == ~st2~0; {23004#true} is VALID [2022-02-20 19:48:09,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {23004#true} assume ~send2~0 == ~id2~0; {23004#true} is VALID [2022-02-20 19:48:09,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {23004#true} assume 0 == ~mode2~0 % 256; {23004#true} is VALID [2022-02-20 19:48:09,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {23004#true} assume ~id3~0 >= 0; {23004#true} is VALID [2022-02-20 19:48:09,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {23004#true} assume 0 == ~st3~0; {23004#true} is VALID [2022-02-20 19:48:09,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {23004#true} assume ~send3~0 == ~id3~0; {23004#true} is VALID [2022-02-20 19:48:09,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {23004#true} assume 0 == ~mode3~0 % 256; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,222 INFO L290 TraceCheckUtils]: 39: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,222 INFO L290 TraceCheckUtils]: 40: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,224 INFO L290 TraceCheckUtils]: 45: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,227 INFO L290 TraceCheckUtils]: 50: Hoare triple {23006#(= (+ (* (- 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; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {23006#(= (+ (* (- 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; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {23006#(= (+ (* (- 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; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {23006#(= (+ (* (- 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; {23006#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:09,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {23006#(= (+ (* (- 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; {23005#false} is VALID [2022-02-20 19:48:09,230 INFO L290 TraceCheckUtils]: 57: Hoare triple {23005#false} assume !(node3_~m3~0#1 != ~nomsg~0); {23005#false} is VALID [2022-02-20 19:48:09,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {23005#false} ~mode3~0 := 0; {23005#false} is VALID [2022-02-20 19:48:09,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {23005#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; {23005#false} is VALID [2022-02-20 19:48:09,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {23005#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23005#false} is VALID [2022-02-20 19:48:09,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {23005#false} assume !(node4_~m4~0#1 != ~nomsg~0); {23005#false} is VALID [2022-02-20 19:48:09,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {23005#false} ~mode4~0 := 0; {23005#false} is VALID [2022-02-20 19:48:09,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {23005#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {23005#false} is VALID [2022-02-20 19:48:09,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {23005#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23005#false} is VALID [2022-02-20 19:48:09,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {23005#false} assume !(node5_~m5~0#1 != ~nomsg~0); {23005#false} is VALID [2022-02-20 19:48:09,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {23005#false} ~mode5~0 := 0; {23005#false} is VALID [2022-02-20 19:48:09,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {23005#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {23005#false} is VALID [2022-02-20 19:48:09,232 INFO L290 TraceCheckUtils]: 68: Hoare triple {23005#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {23005#false} is VALID [2022-02-20 19:48:09,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {23005#false} assume !(node6_~m6~0#1 != ~nomsg~0); {23005#false} is VALID [2022-02-20 19:48:09,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {23005#false} ~mode6~0 := 0; {23005#false} is VALID [2022-02-20 19:48:09,232 INFO L290 TraceCheckUtils]: 71: Hoare triple {23005#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23005#false} is VALID [2022-02-20 19:48:09,233 INFO L290 TraceCheckUtils]: 72: Hoare triple {23005#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {23005#false} is VALID [2022-02-20 19:48:09,233 INFO L290 TraceCheckUtils]: 73: Hoare triple {23005#false} check_#res#1 := check_~tmp~1#1; {23005#false} is VALID [2022-02-20 19:48:09,233 INFO L290 TraceCheckUtils]: 74: Hoare triple {23005#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {23005#false} is VALID [2022-02-20 19:48:09,233 INFO L290 TraceCheckUtils]: 75: Hoare triple {23005#false} assume 0 == assert_~arg#1 % 256; {23005#false} is VALID [2022-02-20 19:48:09,233 INFO L290 TraceCheckUtils]: 76: Hoare triple {23005#false} assume !false; {23005#false} is VALID [2022-02-20 19:48:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:48:09,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:09,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867163675] [2022-02-20 19:48:09,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867163675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:09,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:09,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:09,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429589143] [2022-02-20 19:48:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:09,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:09,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:09,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:09,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:09,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:09,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:09,286 INFO L87 Difference]: Start difference. First operand 1667 states and 2696 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:11,146 INFO L93 Difference]: Finished difference Result 1887 states and 3044 transitions. [2022-02-20 19:48:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:11,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:11,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:12,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:12,741 INFO L225 Difference]: With dead ends: 1887 [2022-02-20 19:48:12,742 INFO L226 Difference]: Without dead ends: 1771 [2022-02-20 19:48:12,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:12,743 INFO L933 BasicCegarLoop]: 1646 mSDtfsCounter, 1519 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:12,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1519 Valid, 1750 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-02-20 19:48:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1769. [2022-02-20 19:48:12,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:12,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:12,793 INFO L74 IsIncluded]: Start isIncluded. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:12,795 INFO L87 Difference]: Start difference. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:12,888 INFO L93 Difference]: Finished difference Result 1771 states and 2858 transitions. [2022-02-20 19:48:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2858 transitions. [2022-02-20 19:48:12,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:12,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:12,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 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 1771 states. [2022-02-20 19:48:12,896 INFO L87 Difference]: Start difference. First operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 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 1771 states. [2022-02-20 19:48:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:12,991 INFO L93 Difference]: Finished difference Result 1771 states and 2858 transitions. [2022-02-20 19:48:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2858 transitions. [2022-02-20 19:48:12,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:12,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:12,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:12,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2857 transitions. [2022-02-20 19:48:13,146 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2857 transitions. Word has length 77 [2022-02-20 19:48:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:13,147 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 2857 transitions. [2022-02-20 19:48:13,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2857 transitions. [2022-02-20 19:48:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:13,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:13,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:48:13,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:48:13,148 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1153858295, now seen corresponding path program 1 times [2022-02-20 19:48:13,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:13,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383587204] [2022-02-20 19:48:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:13,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {30319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {30319#true} is VALID [2022-02-20 19:48:13,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {30319#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {30319#true} is VALID [2022-02-20 19:48:13,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {30319#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {30319#true} is VALID [2022-02-20 19:48:13,212 INFO L290 TraceCheckUtils]: 3: Hoare triple {30319#true} assume 0 == ~r1~0 % 256; {30319#true} is VALID [2022-02-20 19:48:13,212 INFO L290 TraceCheckUtils]: 4: Hoare triple {30319#true} assume ~id1~0 >= 0; {30319#true} is VALID [2022-02-20 19:48:13,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {30319#true} assume 0 == ~st1~0; {30319#true} is VALID [2022-02-20 19:48:13,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {30319#true} assume ~send1~0 == ~id1~0; {30319#true} is VALID [2022-02-20 19:48:13,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {30319#true} assume 0 == ~mode1~0 % 256; {30319#true} is VALID [2022-02-20 19:48:13,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {30319#true} assume ~id2~0 >= 0; {30319#true} is VALID [2022-02-20 19:48:13,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {30319#true} assume 0 == ~st2~0; {30319#true} is VALID [2022-02-20 19:48:13,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {30319#true} assume ~send2~0 == ~id2~0; {30319#true} is VALID [2022-02-20 19:48:13,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {30319#true} assume 0 == ~mode2~0 % 256; {30319#true} is VALID [2022-02-20 19:48:13,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {30319#true} assume ~id3~0 >= 0; {30319#true} is VALID [2022-02-20 19:48:13,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {30319#true} assume 0 == ~st3~0; {30319#true} is VALID [2022-02-20 19:48:13,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {30319#true} assume ~send3~0 == ~id3~0; {30319#true} is VALID [2022-02-20 19:48:13,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {30319#true} assume 0 == ~mode3~0 % 256; {30319#true} is VALID [2022-02-20 19:48:13,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {30319#true} assume ~id4~0 >= 0; {30319#true} is VALID [2022-02-20 19:48:13,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {30319#true} assume 0 == ~st4~0; {30319#true} is VALID [2022-02-20 19:48:13,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {30319#true} assume ~send4~0 == ~id4~0; {30319#true} is VALID [2022-02-20 19:48:13,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {30319#true} assume 0 == ~mode4~0 % 256; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {30321#(= (+ (* (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; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {30321#(= (+ (* (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; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {30321#(= (+ (* (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; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {30321#(= (+ (* (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; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {30321#(= (+ (* (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; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {30321#(= (+ (* (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; {30321#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:13,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {30321#(= (+ (* (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; {30320#false} is VALID [2022-02-20 19:48:13,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {30320#false} assume !(node4_~m4~0#1 != ~nomsg~0); {30320#false} is VALID [2022-02-20 19:48:13,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {30320#false} ~mode4~0 := 0; {30320#false} is VALID [2022-02-20 19:48:13,234 INFO L290 TraceCheckUtils]: 63: Hoare triple {30320#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {30320#false} is VALID [2022-02-20 19:48:13,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {30320#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {30320#false} is VALID [2022-02-20 19:48:13,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {30320#false} assume !(node5_~m5~0#1 != ~nomsg~0); {30320#false} is VALID [2022-02-20 19:48:13,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {30320#false} ~mode5~0 := 0; {30320#false} is VALID [2022-02-20 19:48:13,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {30320#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {30320#false} is VALID [2022-02-20 19:48:13,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {30320#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {30320#false} is VALID [2022-02-20 19:48:13,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {30320#false} assume !(node6_~m6~0#1 != ~nomsg~0); {30320#false} is VALID [2022-02-20 19:48:13,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {30320#false} ~mode6~0 := 0; {30320#false} is VALID [2022-02-20 19:48:13,235 INFO L290 TraceCheckUtils]: 71: Hoare triple {30320#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {30320#false} is VALID [2022-02-20 19:48:13,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {30320#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {30320#false} is VALID [2022-02-20 19:48:13,235 INFO L290 TraceCheckUtils]: 73: Hoare triple {30320#false} check_#res#1 := check_~tmp~1#1; {30320#false} is VALID [2022-02-20 19:48:13,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {30320#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {30320#false} is VALID [2022-02-20 19:48:13,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {30320#false} assume 0 == assert_~arg#1 % 256; {30320#false} is VALID [2022-02-20 19:48:13,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {30320#false} assume !false; {30320#false} is VALID [2022-02-20 19:48:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:48:13,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:13,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383587204] [2022-02-20 19:48:13,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383587204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:13,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:13,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:13,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627111071] [2022-02-20 19:48:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:13,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:13,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:13,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:13,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:13,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:13,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:13,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:13,296 INFO L87 Difference]: Start difference. First operand 1769 states and 2857 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:15,308 INFO L93 Difference]: Finished difference Result 2181 states and 3507 transitions. [2022-02-20 19:48:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:15,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:15,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:16,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:16,903 INFO L225 Difference]: With dead ends: 2181 [2022-02-20 19:48:16,903 INFO L226 Difference]: Without dead ends: 1963 [2022-02-20 19:48:16,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:16,905 INFO L933 BasicCegarLoop]: 1641 mSDtfsCounter, 1515 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:16,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-02-20 19:48:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1961. [2022-02-20 19:48:16,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:16,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.6115364982133742) internal successors, (3157), 1960 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:16,989 INFO L74 IsIncluded]: Start isIncluded. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.6115364982133742) internal successors, (3157), 1960 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:16,991 INFO L87 Difference]: Start difference. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.6115364982133742) internal successors, (3157), 1960 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:17,152 INFO L93 Difference]: Finished difference Result 1963 states and 3158 transitions. [2022-02-20 19:48:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3158 transitions. [2022-02-20 19:48:17,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:17,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:17,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 1961 states, 1959 states have (on average 1.6115364982133742) internal successors, (3157), 1960 states have internal predecessors, (3157), 0 states have call successors, (0), 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 1963 states. [2022-02-20 19:48:17,161 INFO L87 Difference]: Start difference. First operand has 1961 states, 1959 states have (on average 1.6115364982133742) internal successors, (3157), 1960 states have internal predecessors, (3157), 0 states have call successors, (0), 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 1963 states. [2022-02-20 19:48:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:17,332 INFO L93 Difference]: Finished difference Result 1963 states and 3158 transitions. [2022-02-20 19:48:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3158 transitions. [2022-02-20 19:48:17,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:17,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:17,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:17,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1959 states have (on average 1.6115364982133742) internal successors, (3157), 1960 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3157 transitions. [2022-02-20 19:48:17,507 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3157 transitions. Word has length 77 [2022-02-20 19:48:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:17,507 INFO L470 AbstractCegarLoop]: Abstraction has 1961 states and 3157 transitions. [2022-02-20 19:48:17,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3157 transitions. [2022-02-20 19:48:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:17,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:17,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:48:17,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:48:17,509 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1546824319, now seen corresponding path program 1 times [2022-02-20 19:48:17,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:17,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143583712] [2022-02-20 19:48:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:17,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {38594#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {38594#true} is VALID [2022-02-20 19:48:17,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {38594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {38594#true} is VALID [2022-02-20 19:48:17,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {38594#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38594#true} is VALID [2022-02-20 19:48:17,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {38594#true} assume 0 == ~r1~0 % 256; {38594#true} is VALID [2022-02-20 19:48:17,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {38594#true} assume ~id1~0 >= 0; {38594#true} is VALID [2022-02-20 19:48:17,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {38594#true} assume 0 == ~st1~0; {38594#true} is VALID [2022-02-20 19:48:17,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {38594#true} assume ~send1~0 == ~id1~0; {38594#true} is VALID [2022-02-20 19:48:17,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {38594#true} assume 0 == ~mode1~0 % 256; {38594#true} is VALID [2022-02-20 19:48:17,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {38594#true} assume ~id2~0 >= 0; {38594#true} is VALID [2022-02-20 19:48:17,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {38594#true} assume 0 == ~st2~0; {38594#true} is VALID [2022-02-20 19:48:17,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {38594#true} assume ~send2~0 == ~id2~0; {38594#true} is VALID [2022-02-20 19:48:17,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {38594#true} assume 0 == ~mode2~0 % 256; {38594#true} is VALID [2022-02-20 19:48:17,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {38594#true} assume ~id3~0 >= 0; {38594#true} is VALID [2022-02-20 19:48:17,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {38594#true} assume 0 == ~st3~0; {38594#true} is VALID [2022-02-20 19:48:17,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {38594#true} assume ~send3~0 == ~id3~0; {38594#true} is VALID [2022-02-20 19:48:17,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {38594#true} assume 0 == ~mode3~0 % 256; {38594#true} is VALID [2022-02-20 19:48:17,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {38594#true} assume ~id4~0 >= 0; {38594#true} is VALID [2022-02-20 19:48:17,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {38594#true} assume 0 == ~st4~0; {38594#true} is VALID [2022-02-20 19:48:17,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {38594#true} assume ~send4~0 == ~id4~0; {38594#true} is VALID [2022-02-20 19:48:17,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {38594#true} assume 0 == ~mode4~0 % 256; {38594#true} is VALID [2022-02-20 19:48:17,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {38594#true} assume ~id5~0 >= 0; {38594#true} is VALID [2022-02-20 19:48:17,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {38594#true} assume 0 == ~st5~0; {38594#true} is VALID [2022-02-20 19:48:17,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {38594#true} assume ~send5~0 == ~id5~0; {38594#true} is VALID [2022-02-20 19:48:17,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {38594#true} assume 0 == ~mode5~0 % 256; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:17,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {38596#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38595#false} is VALID [2022-02-20 19:48:17,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {38595#false} assume !(node5_~m5~0#1 != ~nomsg~0); {38595#false} is VALID [2022-02-20 19:48:17,605 INFO L290 TraceCheckUtils]: 66: Hoare triple {38595#false} ~mode5~0 := 0; {38595#false} is VALID [2022-02-20 19:48:17,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {38595#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {38595#false} is VALID [2022-02-20 19:48:17,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {38595#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {38595#false} is VALID [2022-02-20 19:48:17,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {38595#false} assume !(node6_~m6~0#1 != ~nomsg~0); {38595#false} is VALID [2022-02-20 19:48:17,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {38595#false} ~mode6~0 := 0; {38595#false} is VALID [2022-02-20 19:48:17,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {38595#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38595#false} is VALID [2022-02-20 19:48:17,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {38595#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {38595#false} is VALID [2022-02-20 19:48:17,606 INFO L290 TraceCheckUtils]: 73: Hoare triple {38595#false} check_#res#1 := check_~tmp~1#1; {38595#false} is VALID [2022-02-20 19:48:17,607 INFO L290 TraceCheckUtils]: 74: Hoare triple {38595#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38595#false} is VALID [2022-02-20 19:48:17,607 INFO L290 TraceCheckUtils]: 75: Hoare triple {38595#false} assume 0 == assert_~arg#1 % 256; {38595#false} is VALID [2022-02-20 19:48:17,607 INFO L290 TraceCheckUtils]: 76: Hoare triple {38595#false} assume !false; {38595#false} is VALID [2022-02-20 19:48:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:48:17,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:17,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143583712] [2022-02-20 19:48:17,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143583712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:17,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:17,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:17,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768951913] [2022-02-20 19:48:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:17,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:17,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:17,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:17,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:17,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:17,662 INFO L87 Difference]: Start difference. First operand 1961 states and 3157 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:19,589 INFO L93 Difference]: Finished difference Result 2733 states and 4367 transitions. [2022-02-20 19:48:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:19,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:19,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:21,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:21,239 INFO L225 Difference]: With dead ends: 2733 [2022-02-20 19:48:21,239 INFO L226 Difference]: Without dead ends: 2323 [2022-02-20 19:48:21,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:21,241 INFO L933 BasicCegarLoop]: 1636 mSDtfsCounter, 1511 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:21,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1748 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2022-02-20 19:48:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2321. [2022-02-20 19:48:21,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:21,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.6011211729193617) internal successors, (3713), 2320 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,357 INFO L74 IsIncluded]: Start isIncluded. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.6011211729193617) internal successors, (3713), 2320 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,359 INFO L87 Difference]: Start difference. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.6011211729193617) internal successors, (3713), 2320 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:21,511 INFO L93 Difference]: Finished difference Result 2323 states and 3714 transitions. [2022-02-20 19:48:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3714 transitions. [2022-02-20 19:48:21,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:21,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:21,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 2321 states, 2319 states have (on average 1.6011211729193617) internal successors, (3713), 2320 states have internal predecessors, (3713), 0 states have call successors, (0), 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 2323 states. [2022-02-20 19:48:21,520 INFO L87 Difference]: Start difference. First operand has 2321 states, 2319 states have (on average 1.6011211729193617) internal successors, (3713), 2320 states have internal predecessors, (3713), 0 states have call successors, (0), 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 2323 states. [2022-02-20 19:48:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:21,698 INFO L93 Difference]: Finished difference Result 2323 states and 3714 transitions. [2022-02-20 19:48:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3714 transitions. [2022-02-20 19:48:21,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:21,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:21,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:21,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2319 states have (on average 1.6011211729193617) internal successors, (3713), 2320 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3713 transitions. [2022-02-20 19:48:21,887 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3713 transitions. Word has length 77 [2022-02-20 19:48:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:21,887 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 3713 transitions. [2022-02-20 19:48:21,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3713 transitions. [2022-02-20 19:48:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:21,893 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:21,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:48:21,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:48:21,893 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:21,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1884617461, now seen corresponding path program 1 times [2022-02-20 19:48:21,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:21,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770124375] [2022-02-20 19:48:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:21,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {48681#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {48681#true} is VALID [2022-02-20 19:48:21,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {48681#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {48681#true} is VALID [2022-02-20 19:48:21,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {48681#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {48681#true} is VALID [2022-02-20 19:48:21,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {48681#true} assume 0 == ~r1~0 % 256; {48681#true} is VALID [2022-02-20 19:48:21,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {48681#true} assume ~id1~0 >= 0; {48681#true} is VALID [2022-02-20 19:48:21,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {48681#true} assume 0 == ~st1~0; {48681#true} is VALID [2022-02-20 19:48:21,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {48681#true} assume ~send1~0 == ~id1~0; {48681#true} is VALID [2022-02-20 19:48:21,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {48681#true} assume 0 == ~mode1~0 % 256; {48681#true} is VALID [2022-02-20 19:48:21,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {48681#true} assume ~id2~0 >= 0; {48681#true} is VALID [2022-02-20 19:48:21,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {48681#true} assume 0 == ~st2~0; {48681#true} is VALID [2022-02-20 19:48:21,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {48681#true} assume ~send2~0 == ~id2~0; {48681#true} is VALID [2022-02-20 19:48:21,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {48681#true} assume 0 == ~mode2~0 % 256; {48681#true} is VALID [2022-02-20 19:48:21,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {48681#true} assume ~id3~0 >= 0; {48681#true} is VALID [2022-02-20 19:48:21,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {48681#true} assume 0 == ~st3~0; {48681#true} is VALID [2022-02-20 19:48:21,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {48681#true} assume ~send3~0 == ~id3~0; {48681#true} is VALID [2022-02-20 19:48:21,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {48681#true} assume 0 == ~mode3~0 % 256; {48681#true} is VALID [2022-02-20 19:48:21,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {48681#true} assume ~id4~0 >= 0; {48681#true} is VALID [2022-02-20 19:48:21,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {48681#true} assume 0 == ~st4~0; {48681#true} is VALID [2022-02-20 19:48:21,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {48681#true} assume ~send4~0 == ~id4~0; {48681#true} is VALID [2022-02-20 19:48:21,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {48681#true} assume 0 == ~mode4~0 % 256; {48681#true} is VALID [2022-02-20 19:48:21,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {48681#true} assume ~id5~0 >= 0; {48681#true} is VALID [2022-02-20 19:48:21,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {48681#true} assume 0 == ~st5~0; {48681#true} is VALID [2022-02-20 19:48:21,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {48681#true} assume ~send5~0 == ~id5~0; {48681#true} is VALID [2022-02-20 19:48:21,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {48681#true} assume 0 == ~mode5~0 % 256; {48681#true} is VALID [2022-02-20 19:48:21,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {48681#true} assume ~id6~0 >= 0; {48681#true} is VALID [2022-02-20 19:48:21,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {48681#true} assume 0 == ~st6~0; {48681#true} is VALID [2022-02-20 19:48:21,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {48681#true} assume ~send6~0 == ~id6~0; {48681#true} is VALID [2022-02-20 19:48:21,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {48681#true} assume 0 == ~mode6~0 % 256; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,977 INFO L290 TraceCheckUtils]: 59: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,981 INFO L290 TraceCheckUtils]: 66: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:21,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {48683#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {48682#false} is VALID [2022-02-20 19:48:21,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {48682#false} assume !(node6_~m6~0#1 != ~nomsg~0); {48682#false} is VALID [2022-02-20 19:48:21,990 INFO L290 TraceCheckUtils]: 70: Hoare triple {48682#false} ~mode6~0 := 0; {48682#false} is VALID [2022-02-20 19:48:21,990 INFO L290 TraceCheckUtils]: 71: Hoare triple {48682#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {48682#false} is VALID [2022-02-20 19:48:21,990 INFO L290 TraceCheckUtils]: 72: Hoare triple {48682#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {48682#false} is VALID [2022-02-20 19:48:21,990 INFO L290 TraceCheckUtils]: 73: Hoare triple {48682#false} check_#res#1 := check_~tmp~1#1; {48682#false} is VALID [2022-02-20 19:48:21,990 INFO L290 TraceCheckUtils]: 74: Hoare triple {48682#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {48682#false} is VALID [2022-02-20 19:48:21,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {48682#false} assume 0 == assert_~arg#1 % 256; {48682#false} is VALID [2022-02-20 19:48:21,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {48682#false} assume !false; {48682#false} is VALID [2022-02-20 19:48:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:48:21,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:21,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770124375] [2022-02-20 19:48:21,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770124375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:21,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:21,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:21,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485346946] [2022-02-20 19:48:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:21,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:21,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:22,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:22,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:22,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:22,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:22,043 INFO L87 Difference]: Start difference. First operand 2321 states and 3713 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:24,269 INFO L93 Difference]: Finished difference Result 3765 states and 5955 transitions. [2022-02-20 19:48:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:24,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:24,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:25,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:26,008 INFO L225 Difference]: With dead ends: 3765 [2022-02-20 19:48:26,008 INFO L226 Difference]: Without dead ends: 2995 [2022-02-20 19:48:26,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:26,010 INFO L933 BasicCegarLoop]: 1631 mSDtfsCounter, 1507 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:26,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1747 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2022-02-20 19:48:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2993. [2022-02-20 19:48:26,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:26,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.583751253761284) internal successors, (4737), 2992 states have internal predecessors, (4737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:26,219 INFO L74 IsIncluded]: Start isIncluded. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.583751253761284) internal successors, (4737), 2992 states have internal predecessors, (4737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:26,223 INFO L87 Difference]: Start difference. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.583751253761284) internal successors, (4737), 2992 states have internal predecessors, (4737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:26,568 INFO L93 Difference]: Finished difference Result 2995 states and 4738 transitions. [2022-02-20 19:48:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4738 transitions. [2022-02-20 19:48:26,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:26,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:26,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 2993 states, 2991 states have (on average 1.583751253761284) internal successors, (4737), 2992 states have internal predecessors, (4737), 0 states have call successors, (0), 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 2995 states. [2022-02-20 19:48:26,576 INFO L87 Difference]: Start difference. First operand has 2993 states, 2991 states have (on average 1.583751253761284) internal successors, (4737), 2992 states have internal predecessors, (4737), 0 states have call successors, (0), 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 2995 states. [2022-02-20 19:48:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:26,817 INFO L93 Difference]: Finished difference Result 2995 states and 4738 transitions. [2022-02-20 19:48:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4738 transitions. [2022-02-20 19:48:26,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:26,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:26,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:26,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2991 states have (on average 1.583751253761284) internal successors, (4737), 2992 states have internal predecessors, (4737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4737 transitions. [2022-02-20 19:48:27,133 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4737 transitions. Word has length 77 [2022-02-20 19:48:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:27,134 INFO L470 AbstractCegarLoop]: Abstraction has 2993 states and 4737 transitions. [2022-02-20 19:48:27,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4737 transitions. [2022-02-20 19:48:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:27,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:27,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:48:27,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:48:27,135 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2001711063, now seen corresponding path program 1 times [2022-02-20 19:48:27,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:27,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844857739] [2022-02-20 19:48:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:27,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {62176#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {62176#true} is VALID [2022-02-20 19:48:27,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {62176#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {62176#true} is VALID [2022-02-20 19:48:27,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {62176#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {62176#true} is VALID [2022-02-20 19:48:27,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {62176#true} assume 0 == ~r1~0 % 256; {62176#true} is VALID [2022-02-20 19:48:27,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {62176#true} assume ~id1~0 >= 0; {62176#true} is VALID [2022-02-20 19:48:27,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {62176#true} assume 0 == ~st1~0; {62178#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:27,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {62178#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {62178#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:27,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {62178#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {62178#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:27,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {62178#(<= ~st1~0 0)} assume ~id2~0 >= 0; {62178#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:27,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {62178#(<= ~st1~0 0)} assume 0 == ~st2~0; {62179#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {62179#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {62179#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {62179#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {62179#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {62179#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {62179#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {62179#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {62180#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {62180#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {62180#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {62180#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {62180#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {62180#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {62180#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {62180#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {62181#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {62181#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {62181#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {62181#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {62181#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {62181#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {62181#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {62181#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {62182#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {62182#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {62182#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {62182#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {62182#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {62182#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {62182#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:27,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {62182#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,259 INFO L290 TraceCheckUtils]: 51: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,261 INFO L290 TraceCheckUtils]: 55: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,263 INFO L290 TraceCheckUtils]: 58: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,263 INFO L290 TraceCheckUtils]: 59: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,263 INFO L290 TraceCheckUtils]: 60: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,265 INFO L290 TraceCheckUtils]: 64: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,267 INFO L290 TraceCheckUtils]: 68: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,267 INFO L290 TraceCheckUtils]: 69: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0);node6_#t~ite10#1 := ~p6_new~0; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,268 INFO L290 TraceCheckUtils]: 70: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,268 INFO L290 TraceCheckUtils]: 71: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:27,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {62183#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {62177#false} is VALID [2022-02-20 19:48:27,269 INFO L290 TraceCheckUtils]: 73: Hoare triple {62177#false} check_#res#1 := check_~tmp~1#1; {62177#false} is VALID [2022-02-20 19:48:27,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {62177#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {62177#false} is VALID [2022-02-20 19:48:27,269 INFO L290 TraceCheckUtils]: 75: Hoare triple {62177#false} assume 0 == assert_~arg#1 % 256; {62177#false} is VALID [2022-02-20 19:48:27,269 INFO L290 TraceCheckUtils]: 76: Hoare triple {62177#false} assume !false; {62177#false} is VALID [2022-02-20 19:48:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:48:27,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:27,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844857739] [2022-02-20 19:48:27,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844857739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:27,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:27,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:48:27,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363857598] [2022-02-20 19:48:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:27,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 19:48:27,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:27,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:27,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:27,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:48:27,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:48:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:48:27,331 INFO L87 Difference]: Start difference. First operand 2993 states and 4737 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)