./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.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.BOUNDED-12.pals+Problem12_label04.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 e1f94066d185a25351cbcea30e35499f745a051fde3e7dea5a9b71a49a6a37f3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:47:02,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:47:02,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:47:02,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:47:02,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:47:02,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:47:03,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:47:03,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:47:03,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:47:03,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:47:03,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:47:03,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:47:03,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:47:03,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:47:03,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:47:03,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:47:03,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:47:03,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:47:03,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:47:03,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:47:03,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:47:03,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:47:03,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:47:03,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:47:03,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:47:03,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:47:03,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:47:03,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:47:03,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:47:03,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:47:03,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:47:03,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:47:03,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:47:03,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:47:03,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:47:03,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:47:03,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:47:03,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:47:03,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:47:03,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:47:03,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:47:03,068 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:03,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:47:03,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:47:03,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:47:03,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:47:03,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:47:03,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:47:03,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:47:03,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:47:03,100 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:47:03,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:47:03,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:47:03,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:47:03,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:47:03,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:47:03,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:47:03,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:47:03,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:47:03,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:47:03,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:47:03,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:47:03,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:47:03,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:47:03,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:47:03,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:47:03,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:47:03,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:47:03,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:47:03,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:47:03,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:47:03,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:47:03,109 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:47:03,109 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:47:03,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:47:03,110 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 -> e1f94066d185a25351cbcea30e35499f745a051fde3e7dea5a9b71a49a6a37f3 [2022-02-20 19:47:03,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:47:03,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:47:03,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:47:03,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:47:03,327 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:47:03,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.c [2022-02-20 19:47:03,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3198246/003733e61e9e498fbe7ebe2b1d00d43f/FLAG62978a7ca [2022-02-20 19:47:03,982 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:47:03,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.c [2022-02-20 19:47:04,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3198246/003733e61e9e498fbe7ebe2b1d00d43f/FLAG62978a7ca [2022-02-20 19:47:04,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3198246/003733e61e9e498fbe7ebe2b1d00d43f [2022-02-20 19:47:04,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:47:04,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:47:04,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:47:04,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:47:04,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:47:04,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:47:04" (1/1) ... [2022-02-20 19:47:04,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cdb9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:04, skipping insertion in model container [2022-02-20 19:47:04,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:47:04" (1/1) ... [2022-02-20 19:47:04,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:47:04,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:47:04,651 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.BOUNDED-12.pals+Problem12_label04.c[15482,15495] [2022-02-20 19:47:04,709 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.BOUNDED-12.pals+Problem12_label04.c[22543,22556] [2022-02-20 19:47:05,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:47:05,393 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:47:05,440 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.BOUNDED-12.pals+Problem12_label04.c[15482,15495] [2022-02-20 19:47:05,452 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.BOUNDED-12.pals+Problem12_label04.c[22543,22556] [2022-02-20 19:47:05,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:47:05,841 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:47:05,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05 WrapperNode [2022-02-20 19:47:05,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:47:05,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:47:05,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:47:05,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:47:05,850 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:05" (1/1) ... [2022-02-20 19:47:05,902 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:05" (1/1) ... [2022-02-20 19:47:06,370 INFO L137 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5149 [2022-02-20 19:47:06,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:47:06,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:47:06,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:47:06,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:47:06,389 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:05" (1/1) ... [2022-02-20 19:47:06,390 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:05" (1/1) ... [2022-02-20 19:47:06,499 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:05" (1/1) ... [2022-02-20 19:47:06,515 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:05" (1/1) ... [2022-02-20 19:47:06,751 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:05" (1/1) ... [2022-02-20 19:47:06,800 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:05" (1/1) ... [2022-02-20 19:47:06,851 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:05" (1/1) ... [2022-02-20 19:47:06,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:47:06,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:47:06,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:47:06,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:47:06,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:06,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:47:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:47:06,949 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:06,970 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:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:47:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:47:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:47:06,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:47:07,124 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:47:07,126 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:47:14,917 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:47:14,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:47:14,940 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:47:14,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:14 BoogieIcfgContainer [2022-02-20 19:47:14,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:47:14,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:47:14,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:47:14,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:47:14,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:47:04" (1/3) ... [2022-02-20 19:47:14,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163f78b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:14, skipping insertion in model container [2022-02-20 19:47:14,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (2/3) ... [2022-02-20 19:47:14,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163f78b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:14, skipping insertion in model container [2022-02-20 19:47:14,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:14" (3/3) ... [2022-02-20 19:47:14,950 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.c [2022-02-20 19:47:14,954 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:47:14,955 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:47:14,998 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:47:15,004 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:15,004 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:47:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 926 states, 923 states have (on average 1.8992416034669555) internal successors, (1753), 925 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call 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:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:47:15,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:15,049 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:15,049 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:15,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash 340623278, now seen corresponding path program 1 times [2022-02-20 19:47:15,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:15,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294903535] [2022-02-20 19:47:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:15,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#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(33, 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; {929#true} is VALID [2022-02-20 19:47:15,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {929#true} is VALID [2022-02-20 19:47:15,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~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; {929#true} is VALID [2022-02-20 19:47:15,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {929#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {929#true} is VALID [2022-02-20 19:47:15,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {929#true} init_#res#1 := init_~tmp~0#1; {929#true} is VALID [2022-02-20 19:47:15,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#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; {929#true} is VALID [2022-02-20 19:47:15,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {930#false} is VALID [2022-02-20 19:47:15,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:15,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#false} assume !!(main1_~i2~0#1 < 12);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; {930#false} is VALID [2022-02-20 19:47:15,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {930#false} is VALID [2022-02-20 19:47:15,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {930#false} assume !(node1_~m1~0#1 != ~nomsg~0); {930#false} is VALID [2022-02-20 19:47:15,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {930#false} ~mode1~0 := 0; {930#false} is VALID [2022-02-20 19:47:15,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:15,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {930#false} assume !(0 != ~mode2~0 % 256); {930#false} is VALID [2022-02-20 19:47:15,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {930#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {930#false} is VALID [2022-02-20 19:47:15,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {930#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {930#false} is VALID [2022-02-20 19:47:15,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:15,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#false} assume !(0 != ~mode3~0 % 256); {930#false} is VALID [2022-02-20 19:47:15,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {930#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {930#false} is VALID [2022-02-20 19:47:15,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {930#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {930#false} is VALID [2022-02-20 19:47:15,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:15,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {930#false} assume !(0 != ~mode4~0 % 256); {930#false} is VALID [2022-02-20 19:47:15,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {930#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {930#false} is VALID [2022-02-20 19:47:15,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {930#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {930#false} is VALID [2022-02-20 19:47:15,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:15,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {930#false} assume !(0 != ~mode5~0 % 256); {930#false} is VALID [2022-02-20 19:47:15,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {930#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {930#false} is VALID [2022-02-20 19:47:15,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {930#false} ~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; {930#false} is VALID [2022-02-20 19:47:15,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:15,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {930#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {930#false} is VALID [2022-02-20 19:47:15,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {930#false} assume !(node6_~m6~0#1 != ~nomsg~0); {930#false} is VALID [2022-02-20 19:47:15,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {930#false} ~mode6~0 := 0; {930#false} is VALID [2022-02-20 19:47:15,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:15,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {930#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {930#false} is VALID [2022-02-20 19:47:15,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {930#false} check_#res#1 := check_~tmp~1#1; {930#false} is VALID [2022-02-20 19:47:15,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:15,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {930#false} assume 0 == assert_~arg#1 % 256; {930#false} is VALID [2022-02-20 19:47:15,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-02-20 19:47:15,299 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:15,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:15,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294903535] [2022-02-20 19:47:15,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294903535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:15,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:15,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:47:15,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081162292] [2022-02-20 19:47:15,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:15,309 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:15,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:15,313 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:15,362 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:15,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:47:15,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:47:15,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:47:15,393 INFO L87 Difference]: Start difference. First operand has 926 states, 923 states have (on average 1.8992416034669555) internal successors, (1753), 925 states have internal predecessors, (1753), 0 states have call successors, (0), 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:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:16,878 INFO L93 Difference]: Finished difference Result 1806 states and 3418 transitions. [2022-02-20 19:47:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:47:16,878 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:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:16,880 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:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3418 transitions. [2022-02-20 19:47:16,920 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:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3418 transitions. [2022-02-20 19:47:16,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3418 transitions. [2022-02-20 19:47:19,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3418 edges. 3418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:19,763 INFO L225 Difference]: With dead ends: 1806 [2022-02-20 19:47:19,764 INFO L226 Difference]: Without dead ends: 860 [2022-02-20 19:47:19,769 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:19,772 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:19,773 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:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-20 19:47:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2022-02-20 19:47:19,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:19,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call 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:19,835 INFO L74 IsIncluded]: Start isIncluded. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call 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:19,836 INFO L87 Difference]: Start difference. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call 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:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:19,882 INFO L93 Difference]: Finished difference Result 860 states and 1620 transitions. [2022-02-20 19:47:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1620 transitions. [2022-02-20 19:47:19,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:19,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:19,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 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 860 states. [2022-02-20 19:47:19,890 INFO L87 Difference]: Start difference. First operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 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 860 states. [2022-02-20 19:47:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:19,931 INFO L93 Difference]: Finished difference Result 860 states and 1620 transitions. [2022-02-20 19:47:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1620 transitions. [2022-02-20 19:47:19,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:19,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:19,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:19,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call 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:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1620 transitions. [2022-02-20 19:47:19,984 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1620 transitions. Word has length 38 [2022-02-20 19:47:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:19,985 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1620 transitions. [2022-02-20 19:47:19,985 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:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1620 transitions. [2022-02-20 19:47:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:47:19,986 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:19,986 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:19,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:47:19,987 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash 615382892, now seen corresponding path program 1 times [2022-02-20 19:47:19,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:19,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247028232] [2022-02-20 19:47:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:20,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {5367#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(33, 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; {5367#true} is VALID [2022-02-20 19:47:20,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {5367#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {5367#true} is VALID [2022-02-20 19:47:20,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {5367#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~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; {5367#true} is VALID [2022-02-20 19:47:20,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {5367#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5369#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:47:20,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {5369#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5370#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:47:20,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {5370#(= |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; {5371#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:47:20,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {5371#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5368#false} is VALID [2022-02-20 19:47:20,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:20,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {5368#false} assume !!(main1_~i2~0#1 < 12);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; {5368#false} is VALID [2022-02-20 19:47:20,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {5368#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {5368#false} is VALID [2022-02-20 19:47:20,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {5368#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5368#false} is VALID [2022-02-20 19:47:20,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {5368#false} ~mode1~0 := 0; {5368#false} is VALID [2022-02-20 19:47:20,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:20,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {5368#false} assume !(0 != ~mode2~0 % 256); {5368#false} is VALID [2022-02-20 19:47:20,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {5368#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5368#false} is VALID [2022-02-20 19:47:20,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {5368#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {5368#false} is VALID [2022-02-20 19:47:20,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:20,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {5368#false} assume !(0 != ~mode3~0 % 256); {5368#false} is VALID [2022-02-20 19:47:20,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {5368#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5368#false} is VALID [2022-02-20 19:47:20,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {5368#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {5368#false} is VALID [2022-02-20 19:47:20,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:20,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {5368#false} assume !(0 != ~mode4~0 % 256); {5368#false} is VALID [2022-02-20 19:47:20,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {5368#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {5368#false} is VALID [2022-02-20 19:47:20,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {5368#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {5368#false} is VALID [2022-02-20 19:47:20,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:20,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {5368#false} assume !(0 != ~mode5~0 % 256); {5368#false} is VALID [2022-02-20 19:47:20,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {5368#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {5368#false} is VALID [2022-02-20 19:47:20,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {5368#false} ~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; {5368#false} is VALID [2022-02-20 19:47:20,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:20,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {5368#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5368#false} is VALID [2022-02-20 19:47:20,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {5368#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5368#false} is VALID [2022-02-20 19:47:20,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {5368#false} ~mode6~0 := 0; {5368#false} is VALID [2022-02-20 19:47:20,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:20,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {5368#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {5368#false} is VALID [2022-02-20 19:47:20,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {5368#false} check_#res#1 := check_~tmp~1#1; {5368#false} is VALID [2022-02-20 19:47:20,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:20,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {5368#false} assume 0 == assert_~arg#1 % 256; {5368#false} is VALID [2022-02-20 19:47:20,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2022-02-20 19:47:20,117 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:20,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:20,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247028232] [2022-02-20 19:47:20,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247028232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:20,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:20,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:47:20,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599277036] [2022-02-20 19:47:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:20,119 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:20,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:20,120 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:20,149 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:20,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:47:20,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:47:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:47:20,151 INFO L87 Difference]: Start difference. First operand 860 states and 1620 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:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:24,268 INFO L93 Difference]: Finished difference Result 924 states and 1719 transitions. [2022-02-20 19:47:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:47:24,268 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:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:24,268 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:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:24,287 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:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:24,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1719 transitions. [2022-02-20 19:47:25,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:25,673 INFO L225 Difference]: With dead ends: 924 [2022-02-20 19:47:25,673 INFO L226 Difference]: Without dead ends: 860 [2022-02-20 19:47:25,674 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:25,675 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 3 mSDsluCounter, 4811 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6429 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:25,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6429 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:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-20 19:47:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2022-02-20 19:47:25,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:25,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call 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:25,695 INFO L74 IsIncluded]: Start isIncluded. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call 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:25,697 INFO L87 Difference]: Start difference. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call 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:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:25,734 INFO L93 Difference]: Finished difference Result 860 states and 1580 transitions. [2022-02-20 19:47:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1580 transitions. [2022-02-20 19:47:25,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:25,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:25,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 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 860 states. [2022-02-20 19:47:25,741 INFO L87 Difference]: Start difference. First operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 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 860 states. [2022-02-20 19:47:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:25,780 INFO L93 Difference]: Finished difference Result 860 states and 1580 transitions. [2022-02-20 19:47:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1580 transitions. [2022-02-20 19:47:25,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:25,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:25,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:25,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call 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:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1580 transitions. [2022-02-20 19:47:25,824 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1580 transitions. Word has length 38 [2022-02-20 19:47:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:25,825 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1580 transitions. [2022-02-20 19:47:25,826 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:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1580 transitions. [2022-02-20 19:47:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 19:47:25,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:25,829 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] [2022-02-20 19:47:25,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:47:25,830 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 642093148, now seen corresponding path program 1 times [2022-02-20 19:47:25,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:25,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450449211] [2022-02-20 19:47:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:26,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {8922#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(33, 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; {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet53#1);havoc main_#t~nondet53#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet51#1, main2_#t~ret52#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet51#1 && main2_#t~nondet51#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet51#1;havoc main2_#t~nondet51#1; {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret48#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,074 INFO L290 TraceCheckUtils]: 55: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:26,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8925#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:47:26,075 INFO L290 TraceCheckUtils]: 57: Hoare triple {8925#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8925#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:47:26,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {8925#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8925#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:47:26,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {8925#(not (= 0 (+ (- 13) ~a24~0)))} assume (((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8923#false} is VALID [2022-02-20 19:47:26,076 INFO L290 TraceCheckUtils]: 60: Hoare triple {8923#false} assume !false; {8923#false} is VALID [2022-02-20 19:47:26,077 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:26,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:26,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450449211] [2022-02-20 19:47:26,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450449211] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:26,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:26,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:26,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261149324] [2022-02-20 19:47:26,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:26,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 19:47:26,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:26,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call 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:26,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:26,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:47:26,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:26,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:47:26,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:47:26,137 INFO L87 Difference]: Start difference. First operand 860 states and 1580 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call 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:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:38,844 INFO L93 Difference]: Finished difference Result 3115 states and 5889 transitions. [2022-02-20 19:47:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:47:38,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 19:47:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call 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:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5889 transitions. [2022-02-20 19:47:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call 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:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5889 transitions. [2022-02-20 19:47:38,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5889 transitions. [2022-02-20 19:47:43,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5889 edges. 5889 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:43,947 INFO L225 Difference]: With dead ends: 3115 [2022-02-20 19:47:43,947 INFO L226 Difference]: Without dead ends: 2362 [2022-02-20 19:47:43,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:47:43,949 INFO L933 BasicCegarLoop]: 834 mSDtfsCounter, 2474 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 6404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1250 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:43,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2474 Valid, 852 Invalid, 6404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1250 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-02-20 19:47:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-02-20 19:47:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-02-20 19:47:43,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:44,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2362 states. Second operand has 2362 states, 2360 states have (on average 1.506779661016949) internal successors, (3556), 2361 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call 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,009 INFO L74 IsIncluded]: Start isIncluded. First operand 2362 states. Second operand has 2362 states, 2360 states have (on average 1.506779661016949) internal successors, (3556), 2361 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call 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,015 INFO L87 Difference]: Start difference. First operand 2362 states. Second operand has 2362 states, 2360 states have (on average 1.506779661016949) internal successors, (3556), 2361 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call 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,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:44,257 INFO L93 Difference]: Finished difference Result 2362 states and 3556 transitions. [2022-02-20 19:47:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3556 transitions. [2022-02-20 19:47:44,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:44,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:44,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 2362 states, 2360 states have (on average 1.506779661016949) internal successors, (3556), 2361 states have internal predecessors, (3556), 0 states have call successors, (0), 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 2362 states. [2022-02-20 19:47:44,284 INFO L87 Difference]: Start difference. First operand has 2362 states, 2360 states have (on average 1.506779661016949) internal successors, (3556), 2361 states have internal predecessors, (3556), 0 states have call successors, (0), 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 2362 states. [2022-02-20 19:47:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:44,478 INFO L93 Difference]: Finished difference Result 2362 states and 3556 transitions. [2022-02-20 19:47:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3556 transitions. [2022-02-20 19:47:44,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:44,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:44,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:44,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2360 states have (on average 1.506779661016949) internal successors, (3556), 2361 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call 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,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3556 transitions. [2022-02-20 19:47:44,742 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3556 transitions. Word has length 61 [2022-02-20 19:47:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:44,743 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 3556 transitions. [2022-02-20 19:47:44,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call 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,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3556 transitions. [2022-02-20 19:47:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:44,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:44,745 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:47:44,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:47:44,745 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2101054792, now seen corresponding path program 1 times [2022-02-20 19:47:44,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:44,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642313581] [2022-02-20 19:47:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:44,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:44,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {19186#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(33, 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; {19186#true} is VALID [2022-02-20 19:47:44,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {19186#true} is VALID [2022-02-20 19:47:44,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~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; {19186#true} is VALID [2022-02-20 19:47:44,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {19186#true} assume 0 == ~r1~0; {19186#true} is VALID [2022-02-20 19:47:44,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {19186#true} assume ~id1~0 >= 0; {19186#true} is VALID [2022-02-20 19:47:44,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {19186#true} assume 0 == ~st1~0; {19186#true} is VALID [2022-02-20 19:47:44,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {19186#true} assume ~send1~0 == ~id1~0; {19186#true} is VALID [2022-02-20 19:47:44,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {19186#true} assume 0 == ~mode1~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:44,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {19187#false} is VALID [2022-02-20 19:47:44,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {19187#false} assume !(node1_~m1~0#1 != ~nomsg~0); {19187#false} is VALID [2022-02-20 19:47:44,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {19187#false} ~mode1~0 := 0; {19187#false} is VALID [2022-02-20 19:47:44,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:44,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {19187#false} assume !(0 != ~mode2~0 % 256); {19187#false} is VALID [2022-02-20 19:47:44,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {19187#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {19187#false} is VALID [2022-02-20 19:47:44,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {19187#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {19187#false} is VALID [2022-02-20 19:47:44,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:44,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {19187#false} assume !(0 != ~mode3~0 % 256); {19187#false} is VALID [2022-02-20 19:47:44,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {19187#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {19187#false} is VALID [2022-02-20 19:47:44,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {19187#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {19187#false} is VALID [2022-02-20 19:47:44,873 INFO L290 TraceCheckUtils]: 59: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:44,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {19187#false} assume !(0 != ~mode4~0 % 256); {19187#false} is VALID [2022-02-20 19:47:44,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {19187#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {19187#false} is VALID [2022-02-20 19:47:44,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {19187#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {19187#false} is VALID [2022-02-20 19:47:44,874 INFO L290 TraceCheckUtils]: 63: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:44,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {19187#false} assume !(0 != ~mode5~0 % 256); {19187#false} is VALID [2022-02-20 19:47:44,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {19187#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {19187#false} is VALID [2022-02-20 19:47:44,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {19187#false} ~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; {19187#false} is VALID [2022-02-20 19:47:44,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:44,878 INFO L290 TraceCheckUtils]: 68: Hoare triple {19187#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {19187#false} is VALID [2022-02-20 19:47:44,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {19187#false} assume !(node6_~m6~0#1 != ~nomsg~0); {19187#false} is VALID [2022-02-20 19:47:44,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {19187#false} ~mode6~0 := 0; {19187#false} is VALID [2022-02-20 19:47:44,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:44,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {19187#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {19187#false} is VALID [2022-02-20 19:47:44,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {19187#false} check_#res#1 := check_~tmp~1#1; {19187#false} is VALID [2022-02-20 19:47:44,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:44,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {19187#false} assume 0 == assert_~arg#1 % 256; {19187#false} is VALID [2022-02-20 19:47:44,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {19187#false} assume !false; {19187#false} is VALID [2022-02-20 19:47:44,880 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:44,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:44,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642313581] [2022-02-20 19:47:44,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642313581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:44,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:44,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:44,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917979669] [2022-02-20 19:47:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:44,882 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:47:44,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:44,884 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:47:44,943 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:47:44,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:44,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:44,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:44,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:44,946 INFO L87 Difference]: Start difference. First operand 2362 states and 3556 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:47:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:47,051 INFO L93 Difference]: Finished difference Result 2476 states and 3736 transitions. [2022-02-20 19:47:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:47,052 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:47:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:47,052 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:47:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:47,065 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:47:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:47,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:48,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:48,753 INFO L225 Difference]: With dead ends: 2476 [2022-02-20 19:47:48,753 INFO L226 Difference]: Without dead ends: 2416 [2022-02-20 19:47:48,754 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:47:48,755 INFO L933 BasicCegarLoop]: 1661 mSDtfsCounter, 1524 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1754 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:47:48,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 1754 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2022-02-20 19:47:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2414. [2022-02-20 19:47:48,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:48,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2416 states. Second operand has 2414 states, 2412 states have (on average 1.5087064676616915) internal successors, (3639), 2413 states have internal predecessors, (3639), 0 states have call successors, (0), 0 states have call 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:48,840 INFO L74 IsIncluded]: Start isIncluded. First operand 2416 states. Second operand has 2414 states, 2412 states have (on average 1.5087064676616915) internal successors, (3639), 2413 states have internal predecessors, (3639), 0 states have call successors, (0), 0 states have call 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:48,844 INFO L87 Difference]: Start difference. First operand 2416 states. Second operand has 2414 states, 2412 states have (on average 1.5087064676616915) internal successors, (3639), 2413 states have internal predecessors, (3639), 0 states have call successors, (0), 0 states have call 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,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:49,090 INFO L93 Difference]: Finished difference Result 2416 states and 3640 transitions. [2022-02-20 19:47:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3640 transitions. [2022-02-20 19:47:49,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:49,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:49,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 2414 states, 2412 states have (on average 1.5087064676616915) internal successors, (3639), 2413 states have internal predecessors, (3639), 0 states have call successors, (0), 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 2416 states. [2022-02-20 19:47:49,101 INFO L87 Difference]: Start difference. First operand has 2414 states, 2412 states have (on average 1.5087064676616915) internal successors, (3639), 2413 states have internal predecessors, (3639), 0 states have call successors, (0), 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 2416 states. [2022-02-20 19:47:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:49,269 INFO L93 Difference]: Finished difference Result 2416 states and 3640 transitions. [2022-02-20 19:47:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3640 transitions. [2022-02-20 19:47:49,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:49,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:49,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:49,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2412 states have (on average 1.5087064676616915) internal successors, (3639), 2413 states have internal predecessors, (3639), 0 states have call successors, (0), 0 states have call 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,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3639 transitions. [2022-02-20 19:47:49,524 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3639 transitions. Word has length 77 [2022-02-20 19:47:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:49,524 INFO L470 AbstractCegarLoop]: Abstraction has 2414 states and 3639 transitions. [2022-02-20 19:47:49,525 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:47:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3639 transitions. [2022-02-20 19:47:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:49,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:49,526 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:47:49,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:47:49,526 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1452480302, now seen corresponding path program 1 times [2022-02-20 19:47:49,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:49,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185951224] [2022-02-20 19:47:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:49,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {28990#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(33, 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; {28990#true} is VALID [2022-02-20 19:47:49,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {28990#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {28990#true} is VALID [2022-02-20 19:47:49,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {28990#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~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; {28990#true} is VALID [2022-02-20 19:47:49,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {28990#true} assume 0 == ~r1~0; {28990#true} is VALID [2022-02-20 19:47:49,649 INFO L290 TraceCheckUtils]: 4: Hoare triple {28990#true} assume ~id1~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:49,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {28990#true} assume 0 == ~st1~0; {28990#true} is VALID [2022-02-20 19:47:49,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {28990#true} assume ~send1~0 == ~id1~0; {28990#true} is VALID [2022-02-20 19:47:49,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {28990#true} assume 0 == ~mode1~0 % 256; {28990#true} is VALID [2022-02-20 19:47:49,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {28990#true} assume ~id2~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:49,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {28990#true} assume 0 == ~st2~0; {28990#true} is VALID [2022-02-20 19:47:49,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {28990#true} assume ~send2~0 == ~id2~0; {28990#true} is VALID [2022-02-20 19:47:49,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {28990#true} assume 0 == ~mode2~0 % 256; {28990#true} is VALID [2022-02-20 19:47:49,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {28990#true} assume ~id3~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:49,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {28990#true} assume 0 == ~st3~0; {28990#true} is VALID [2022-02-20 19:47:49,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {28990#true} assume ~send3~0 == ~id3~0; {28990#true} is VALID [2022-02-20 19:47:49,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {28990#true} assume 0 == ~mode3~0 % 256; {28990#true} is VALID [2022-02-20 19:47:49,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {28990#true} assume ~id4~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:49,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {28990#true} assume 0 == ~st4~0; {28990#true} is VALID [2022-02-20 19:47:49,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {28990#true} assume ~send4~0 == ~id4~0; {28990#true} is VALID [2022-02-20 19:47:49,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {28990#true} assume 0 == ~mode4~0 % 256; {28990#true} is VALID [2022-02-20 19:47:49,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {28990#true} assume ~id5~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:49,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {28990#true} assume 0 == ~st5~0; {28990#true} is VALID [2022-02-20 19:47:49,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {28990#true} assume ~send5~0 == ~id5~0; {28990#true} is VALID [2022-02-20 19:47:49,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {28990#true} assume 0 == ~mode5~0 % 256; {28990#true} is VALID [2022-02-20 19:47:49,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {28990#true} assume ~id6~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:49,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {28990#true} assume 0 == ~st6~0; {28990#true} is VALID [2022-02-20 19:47:49,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {28990#true} assume ~send6~0 == ~id6~0; {28990#true} is VALID [2022-02-20 19:47:49,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {28990#true} assume 0 == ~mode6~0 % 256; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,666 INFO L290 TraceCheckUtils]: 51: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,670 INFO L290 TraceCheckUtils]: 63: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,670 INFO L290 TraceCheckUtils]: 64: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:49,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {28992#(= (+ (* (- 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; {28991#false} is VALID [2022-02-20 19:47:49,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {28991#false} assume !(node6_~m6~0#1 != ~nomsg~0); {28991#false} is VALID [2022-02-20 19:47:49,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {28991#false} ~mode6~0 := 0; {28991#false} is VALID [2022-02-20 19:47:49,672 INFO L290 TraceCheckUtils]: 71: Hoare triple {28991#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; {28991#false} is VALID [2022-02-20 19:47:49,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {28991#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {28991#false} is VALID [2022-02-20 19:47:49,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {28991#false} check_#res#1 := check_~tmp~1#1; {28991#false} is VALID [2022-02-20 19:47:49,673 INFO L290 TraceCheckUtils]: 74: Hoare triple {28991#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; {28991#false} is VALID [2022-02-20 19:47:49,673 INFO L290 TraceCheckUtils]: 75: Hoare triple {28991#false} assume 0 == assert_~arg#1 % 256; {28991#false} is VALID [2022-02-20 19:47:49,673 INFO L290 TraceCheckUtils]: 76: Hoare triple {28991#false} assume !false; {28991#false} is VALID [2022-02-20 19:47:49,673 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:49,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:49,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185951224] [2022-02-20 19:47:49,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185951224] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:49,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:49,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:49,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533958638] [2022-02-20 19:47:49,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:49,675 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:47:49,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:49,675 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:47:49,724 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:47:49,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:49,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:49,725 INFO L87 Difference]: Start difference. First operand 2414 states and 3639 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:47:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:51,623 INFO L93 Difference]: Finished difference Result 2626 states and 3975 transitions. [2022-02-20 19:47:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:51,623 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:47:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:51,624 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:47:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:51,629 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:47:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:51,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:53,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:53,243 INFO L225 Difference]: With dead ends: 2626 [2022-02-20 19:47:53,243 INFO L226 Difference]: Without dead ends: 2514 [2022-02-20 19:47:53,244 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:47:53,244 INFO L933 BasicCegarLoop]: 1604 mSDtfsCounter, 1504 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1717 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:47:53,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1504 Valid, 1717 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2022-02-20 19:47:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2512. [2022-02-20 19:47:53,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:53,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2514 states. Second operand has 2512 states, 2510 states have (on average 1.5115537848605578) internal successors, (3794), 2511 states have internal predecessors, (3794), 0 states have call successors, (0), 0 states have call 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:53,330 INFO L74 IsIncluded]: Start isIncluded. First operand 2514 states. Second operand has 2512 states, 2510 states have (on average 1.5115537848605578) internal successors, (3794), 2511 states have internal predecessors, (3794), 0 states have call successors, (0), 0 states have call 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:53,333 INFO L87 Difference]: Start difference. First operand 2514 states. Second operand has 2512 states, 2510 states have (on average 1.5115537848605578) internal successors, (3794), 2511 states have internal predecessors, (3794), 0 states have call successors, (0), 0 states have call 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:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:53,489 INFO L93 Difference]: Finished difference Result 2514 states and 3795 transitions. [2022-02-20 19:47:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3795 transitions. [2022-02-20 19:47:53,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:53,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:53,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 2512 states, 2510 states have (on average 1.5115537848605578) internal successors, (3794), 2511 states have internal predecessors, (3794), 0 states have call successors, (0), 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 2514 states. [2022-02-20 19:47:53,498 INFO L87 Difference]: Start difference. First operand has 2512 states, 2510 states have (on average 1.5115537848605578) internal successors, (3794), 2511 states have internal predecessors, (3794), 0 states have call successors, (0), 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 2514 states. [2022-02-20 19:47:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:53,710 INFO L93 Difference]: Finished difference Result 2514 states and 3795 transitions. [2022-02-20 19:47:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3795 transitions. [2022-02-20 19:47:53,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:53,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:53,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:53,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2510 states have (on average 1.5115537848605578) internal successors, (3794), 2511 states have internal predecessors, (3794), 0 states have call successors, (0), 0 states have call 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:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 3794 transitions. [2022-02-20 19:47:53,971 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 3794 transitions. Word has length 77 [2022-02-20 19:47:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:53,971 INFO L470 AbstractCegarLoop]: Abstraction has 2512 states and 3794 transitions. [2022-02-20 19:47:53,972 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:47:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3794 transitions. [2022-02-20 19:47:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:53,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:53,972 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:47:53,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:47:53,973 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1624501596, now seen corresponding path program 1 times [2022-02-20 19:47:53,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:53,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137422087] [2022-02-20 19:47:53,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:53,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:54,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {39283#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(33, 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; {39283#true} is VALID [2022-02-20 19:47:54,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {39283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {39283#true} is VALID [2022-02-20 19:47:54,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {39283#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~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; {39283#true} is VALID [2022-02-20 19:47:54,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {39283#true} assume 0 == ~r1~0; {39283#true} is VALID [2022-02-20 19:47:54,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {39283#true} assume ~id1~0 >= 0; {39283#true} is VALID [2022-02-20 19:47:54,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {39283#true} assume 0 == ~st1~0; {39285#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:54,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {39285#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {39285#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:54,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {39285#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {39285#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:54,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {39285#(<= ~st1~0 0)} assume ~id2~0 >= 0; {39285#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:54,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {39285#(<= ~st1~0 0)} assume 0 == ~st2~0; {39286#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {39286#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {39286#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {39286#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {39286#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {39286#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {39286#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {39286#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:54,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,111 INFO L290 TraceCheckUtils]: 63: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,111 INFO L290 TraceCheckUtils]: 64: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {39290#(<= (+ ~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 := ~send6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,115 INFO L290 TraceCheckUtils]: 71: Hoare triple {39290#(<= (+ ~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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:54,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {39290#(<= (+ ~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; {39284#false} is VALID [2022-02-20 19:47:54,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {39284#false} check_#res#1 := check_~tmp~1#1; {39284#false} is VALID [2022-02-20 19:47:54,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {39284#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; {39284#false} is VALID [2022-02-20 19:47:54,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {39284#false} assume 0 == assert_~arg#1 % 256; {39284#false} is VALID [2022-02-20 19:47:54,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {39284#false} assume !false; {39284#false} is VALID [2022-02-20 19:47:54,116 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:54,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:54,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137422087] [2022-02-20 19:47:54,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137422087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:54,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:54,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:47:54,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377335549] [2022-02-20 19:47:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:54,118 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:47:54,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:54,118 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:47:54,180 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:47:54,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:47:54,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:47:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:47:54,182 INFO L87 Difference]: Start difference. First operand 2512 states and 3794 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)