./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.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 20bccc5c4039b31e1359e00bb81f308547d82590fa0687937b9518c1e6a7a105 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:39:13,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:39:13,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:39:13,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:39:13,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:39:13,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:39:13,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:39:13,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:39:13,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:39:13,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:39:13,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:39:13,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:39:13,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:39:13,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:39:13,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:39:13,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:39:13,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:39:13,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:39:13,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:39:13,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:39:13,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:39:14,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:39:14,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:39:14,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:39:14,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:39:14,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:39:14,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:39:14,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:39:14,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:39:14,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:39:14,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:39:14,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:39:14,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:39:14,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:39:14,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:39:14,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:39:14,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:39:14,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:39:14,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:39:14,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:39:14,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:39:14,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:39:14,052 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:39:14,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:39:14,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:39:14,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:39:14,054 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:39:14,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:39:14,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:39:14,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:39:14,055 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:39:14,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:39:14,056 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:39:14,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:39:14,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:39:14,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:39:14,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:39:14,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:39:14,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:39:14,057 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:39:14,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:39:14,058 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:39:14,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:39:14,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:39:14,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:39:14,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:39:14,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:14,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:39:14,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:39:14,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:39:14,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:39:14,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:39:14,060 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:39:14,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:39:14,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:39:14,061 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 -> 20bccc5c4039b31e1359e00bb81f308547d82590fa0687937b9518c1e6a7a105 [2022-02-20 19:39:14,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:39:14,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:39:14,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:39:14,305 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:39:14,306 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:39:14,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c [2022-02-20 19:39:14,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e14bb502/315e40b623ee4f68871f2e0ba8ecd5ee/FLAG66e29e7c3 [2022-02-20 19:39:15,030 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:39:15,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c [2022-02-20 19:39:15,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e14bb502/315e40b623ee4f68871f2e0ba8ecd5ee/FLAG66e29e7c3 [2022-02-20 19:39:15,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e14bb502/315e40b623ee4f68871f2e0ba8ecd5ee [2022-02-20 19:39:15,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:39:15,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:39:15,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:15,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:39:15,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:39:15,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:15" (1/1) ... [2022-02-20 19:39:15,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a2cadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:15, skipping insertion in model container [2022-02-20 19:39:15,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:15" (1/1) ... [2022-02-20 19:39:15,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:39:15,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:39:15,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c[6354,6367] [2022-02-20 19:39:15,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c[9861,9874] [2022-02-20 19:39:16,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:16,412 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:39:16,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c[6354,6367] [2022-02-20 19:39:16,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c[9861,9874] [2022-02-20 19:39:16,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:16,890 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:39:16,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16 WrapperNode [2022-02-20 19:39:16,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:16,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:16,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:39:16,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:39:16,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:16,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,429 INFO L137 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4976 [2022-02-20 19:39:17,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:17,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:39:17,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:39:17,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:39:17,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:39:17,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:39:17,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:39:17,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:39:17,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (1/1) ... [2022-02-20 19:39:17,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:17,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:39:17,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:39:17,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:39:18,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:39:18,106 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:39:18,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:39:26,253 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:39:26,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:39:26,274 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:39:26,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:26 BoogieIcfgContainer [2022-02-20 19:39:26,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:39:26,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:39:26,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:39:26,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:39:26,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:39:15" (1/3) ... [2022-02-20 19:39:26,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234b66a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:26, skipping insertion in model container [2022-02-20 19:39:26,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:16" (2/3) ... [2022-02-20 19:39:26,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234b66a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:26, skipping insertion in model container [2022-02-20 19:39:26,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:26" (3/3) ... [2022-02-20 19:39:26,286 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c [2022-02-20 19:39:26,290 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:39:26,291 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:39:26,345 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:39:26,350 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:39:26,350 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:39:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:39:26,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:26,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:26,403 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:26,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash 975463267, now seen corresponding path program 1 times [2022-02-20 19:39:26,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:26,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329438060] [2022-02-20 19:39:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:26,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {881#true} is VALID [2022-02-20 19:39:26,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {881#true} is VALID [2022-02-20 19:39:26,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {881#true} is VALID [2022-02-20 19:39:26,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {881#true} is VALID [2022-02-20 19:39:26,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#true} init_#res#1 := init_~tmp~0#1; {881#true} is VALID [2022-02-20 19:39:26,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {881#true} is VALID [2022-02-20 19:39:26,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume 0 == main1_~i2~0#1;assume false; {882#false} is VALID [2022-02-20 19:39:26,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {882#false} is VALID [2022-02-20 19:39:26,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#false} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {882#false} is VALID [2022-02-20 19:39:26,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {882#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {882#false} is VALID [2022-02-20 19:39:26,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {882#false} assume !(node1_~m1~0#1 != ~nomsg~0); {882#false} is VALID [2022-02-20 19:39:26,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {882#false} ~mode1~0 := 0; {882#false} is VALID [2022-02-20 19:39:26,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {882#false} is VALID [2022-02-20 19:39:26,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {882#false} assume !(0 != ~mode2~0 % 256); {882#false} is VALID [2022-02-20 19:39:26,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {882#false} is VALID [2022-02-20 19:39:26,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {882#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {882#false} is VALID [2022-02-20 19:39:26,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {882#false} is VALID [2022-02-20 19:39:26,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume !(0 != ~mode3~0 % 256); {882#false} is VALID [2022-02-20 19:39:26,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {882#false} is VALID [2022-02-20 19:39:26,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {882#false} is VALID [2022-02-20 19:39:26,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {882#false} is VALID [2022-02-20 19:39:26,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {882#false} is VALID [2022-02-20 19:39:26,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {882#false} check_#res#1 := check_~tmp~1#1; {882#false} is VALID [2022-02-20 19:39:26,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {882#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {882#false} is VALID [2022-02-20 19:39:26,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {882#false} assume 0 == assert_~arg#1 % 256; {882#false} is VALID [2022-02-20 19:39:26,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-02-20 19:39:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:26,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:26,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329438060] [2022-02-20 19:39:26,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329438060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:26,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:26,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:39:26,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80542874] [2022-02-20 19:39:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:26,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:39:26,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:26,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:26,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:26,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:39:26,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:39:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:39:26,655 INFO L87 Difference]: Start difference. First operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:28,172 INFO L93 Difference]: Finished difference Result 1734 states and 3292 transitions. [2022-02-20 19:39:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:39:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:39:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3292 transitions. [2022-02-20 19:39:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3292 transitions. [2022-02-20 19:39:28,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3292 transitions. [2022-02-20 19:39:31,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3292 edges. 3292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:31,093 INFO L225 Difference]: With dead ends: 1734 [2022-02-20 19:39:31,094 INFO L226 Difference]: Without dead ends: 812 [2022-02-20 19:39:31,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:39:31,107 INFO L933 BasicCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:31,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-02-20 19:39:31,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-02-20 19:39:31,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:31,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,200 INFO L74 IsIncluded]: Start isIncluded. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,202 INFO L87 Difference]: Start difference. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:31,241 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions. [2022-02-20 19:39:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:39:31,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:31,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:31,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 812 states. [2022-02-20 19:39:31,254 INFO L87 Difference]: Start difference. First operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 812 states. [2022-02-20 19:39:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:31,292 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions. [2022-02-20 19:39:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:39:31,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:31,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:31,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:31,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1533 transitions. [2022-02-20 19:39:31,342 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1533 transitions. Word has length 26 [2022-02-20 19:39:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:31,343 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1533 transitions. [2022-02-20 19:39:31,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:39:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:39:31,350 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:31,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:31,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:39:31,350 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash 157814817, now seen corresponding path program 1 times [2022-02-20 19:39:31,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:31,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108895843] [2022-02-20 19:39:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:31,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {5094#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5094#true} is VALID [2022-02-20 19:39:31,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {5094#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {5094#true} is VALID [2022-02-20 19:39:31,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {5094#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5094#true} is VALID [2022-02-20 19:39:31,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {5094#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5096#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:39:31,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {5096#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5097#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:39:31,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {5097#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {5098#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID [2022-02-20 19:39:31,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {5098#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {5095#false} is VALID [2022-02-20 19:39:31,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {5095#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5095#false} is VALID [2022-02-20 19:39:31,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {5095#false} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5095#false} is VALID [2022-02-20 19:39:31,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {5095#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5095#false} is VALID [2022-02-20 19:39:31,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {5095#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5095#false} is VALID [2022-02-20 19:39:31,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {5095#false} ~mode1~0 := 0; {5095#false} is VALID [2022-02-20 19:39:31,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {5095#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5095#false} is VALID [2022-02-20 19:39:31,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {5095#false} assume !(0 != ~mode2~0 % 256); {5095#false} is VALID [2022-02-20 19:39:31,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {5095#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5095#false} is VALID [2022-02-20 19:39:31,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {5095#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {5095#false} is VALID [2022-02-20 19:39:31,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {5095#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5095#false} is VALID [2022-02-20 19:39:31,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {5095#false} assume !(0 != ~mode3~0 % 256); {5095#false} is VALID [2022-02-20 19:39:31,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {5095#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5095#false} is VALID [2022-02-20 19:39:31,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {5095#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {5095#false} is VALID [2022-02-20 19:39:31,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {5095#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5095#false} is VALID [2022-02-20 19:39:31,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {5095#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5095#false} is VALID [2022-02-20 19:39:31,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {5095#false} check_#res#1 := check_~tmp~1#1; {5095#false} is VALID [2022-02-20 19:39:31,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {5095#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5095#false} is VALID [2022-02-20 19:39:31,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {5095#false} assume 0 == assert_~arg#1 % 256; {5095#false} is VALID [2022-02-20 19:39:31,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {5095#false} assume !false; {5095#false} is VALID [2022-02-20 19:39:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:31,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:31,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108895843] [2022-02-20 19:39:31,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108895843] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:31,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:31,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:31,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554841763] [2022-02-20 19:39:31,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:31,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:39:31,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:31,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:31,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:31,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:31,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:31,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:31,510 INFO L87 Difference]: Start difference. First operand 812 states and 1533 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:35,474 INFO L93 Difference]: Finished difference Result 888 states and 1649 transitions. [2022-02-20 19:39:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:39:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:39:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:39:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:39:35,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1649 transitions. [2022-02-20 19:39:36,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1649 edges. 1649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:36,780 INFO L225 Difference]: With dead ends: 888 [2022-02-20 19:39:36,781 INFO L226 Difference]: Without dead ends: 848 [2022-02-20 19:39:36,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:39:36,782 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 58 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:36,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 6095 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-02-20 19:39:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 812. [2022-02-20 19:39:36,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:36,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 848 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,808 INFO L74 IsIncluded]: Start isIncluded. First operand 848 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,810 INFO L87 Difference]: Start difference. First operand 848 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:36,847 INFO L93 Difference]: Finished difference Result 848 states and 1573 transitions. [2022-02-20 19:39:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1573 transitions. [2022-02-20 19:39:36,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:36,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:36,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 848 states. [2022-02-20 19:39:36,854 INFO L87 Difference]: Start difference. First operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 848 states. [2022-02-20 19:39:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:36,892 INFO L93 Difference]: Finished difference Result 848 states and 1573 transitions. [2022-02-20 19:39:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1573 transitions. [2022-02-20 19:39:36,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:36,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:36,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:36,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1517 transitions. [2022-02-20 19:39:36,934 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1517 transitions. Word has length 26 [2022-02-20 19:39:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:36,935 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1517 transitions. [2022-02-20 19:39:36,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions. [2022-02-20 19:39:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:39:36,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:36,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:36,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:39:36,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:36,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1133051629, now seen corresponding path program 1 times [2022-02-20 19:39:36,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:36,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322561229] [2022-02-20 19:39:36,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:37,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {8538#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet36#1, main2_#t~ret37#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet36#1 && main2_#t~nondet36#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet36#1;havoc main2_#t~nondet36#1; {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {8540#(<= (+ ~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~ret33#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8540#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:39:37,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {8540#(<= (+ ~a17~0 124) 0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8539#false} is VALID [2022-02-20 19:39:37,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {8539#false} assume !false; {8539#false} is VALID [2022-02-20 19:39:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:37,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:37,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322561229] [2022-02-20 19:39:37,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322561229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:37,088 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:37,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:39:37,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027506734] [2022-02-20 19:39:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:39:37,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:37,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:37,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:37,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:37,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:37,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:37,114 INFO L87 Difference]: Start difference. First operand 812 states and 1517 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:42,998 INFO L93 Difference]: Finished difference Result 2316 states and 4390 transitions. [2022-02-20 19:39:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:42,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:39:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4390 transitions. [2022-02-20 19:39:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4390 transitions. [2022-02-20 19:39:43,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4390 transitions. [2022-02-20 19:39:46,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4390 edges. 4390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:46,768 INFO L225 Difference]: With dead ends: 2316 [2022-02-20 19:39:46,768 INFO L226 Difference]: Without dead ends: 1563 [2022-02-20 19:39:46,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:46,770 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 849 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:46,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 553 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 19:39:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-02-20 19:39:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-02-20 19:39:46,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:46,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.5989750160153748) internal successors, (2496), 1562 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:46,808 INFO L74 IsIncluded]: Start isIncluded. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.5989750160153748) internal successors, (2496), 1562 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:46,811 INFO L87 Difference]: Start difference. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.5989750160153748) internal successors, (2496), 1562 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:46,926 INFO L93 Difference]: Finished difference Result 1563 states and 2496 transitions. [2022-02-20 19:39:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2496 transitions. [2022-02-20 19:39:46,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:46,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:46,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 1563 states, 1561 states have (on average 1.5989750160153748) internal successors, (2496), 1562 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1563 states. [2022-02-20 19:39:46,936 INFO L87 Difference]: Start difference. First operand has 1563 states, 1561 states have (on average 1.5989750160153748) internal successors, (2496), 1562 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1563 states. [2022-02-20 19:39:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:47,048 INFO L93 Difference]: Finished difference Result 1563 states and 2496 transitions. [2022-02-20 19:39:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2496 transitions. [2022-02-20 19:39:47,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:47,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:47,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:47,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 1.5989750160153748) internal successors, (2496), 1562 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2496 transitions. [2022-02-20 19:39:47,177 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2496 transitions. Word has length 30 [2022-02-20 19:39:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:47,178 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 2496 transitions. [2022-02-20 19:39:47,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2496 transitions. [2022-02-20 19:39:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:47,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:47,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:47,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:39:47,180 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1324654887, now seen corresponding path program 1 times [2022-02-20 19:39:47,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:47,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567944171] [2022-02-20 19:39:47,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:47,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:47,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {15587#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {15587#true} is VALID [2022-02-20 19:39:47,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {15587#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {15587#true} is VALID [2022-02-20 19:39:47,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {15587#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15587#true} is VALID [2022-02-20 19:39:47,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {15587#true} assume 0 == ~r1~0; {15587#true} is VALID [2022-02-20 19:39:47,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {15587#true} assume ~id1~0 >= 0; {15587#true} is VALID [2022-02-20 19:39:47,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {15587#true} assume 0 == ~st1~0; {15587#true} is VALID [2022-02-20 19:39:47,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {15587#true} assume ~send1~0 == ~id1~0; {15587#true} is VALID [2022-02-20 19:39:47,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {15587#true} assume 0 == ~mode1~0 % 256; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:47,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {15589#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15588#false} is VALID [2022-02-20 19:39:47,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {15588#false} assume !(node1_~m1~0#1 != ~nomsg~0); {15588#false} is VALID [2022-02-20 19:39:47,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {15588#false} ~mode1~0 := 0; {15588#false} is VALID [2022-02-20 19:39:47,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {15588#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; {15588#false} is VALID [2022-02-20 19:39:47,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {15588#false} assume !(0 != ~mode2~0 % 256); {15588#false} is VALID [2022-02-20 19:39:47,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {15588#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {15588#false} is VALID [2022-02-20 19:39:47,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {15588#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; {15588#false} is VALID [2022-02-20 19:39:47,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {15588#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; {15588#false} is VALID [2022-02-20 19:39:47,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {15588#false} assume !(0 != ~mode3~0 % 256); {15588#false} is VALID [2022-02-20 19:39:47,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {15588#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {15588#false} is VALID [2022-02-20 19:39:47,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {15588#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; {15588#false} is VALID [2022-02-20 19:39:47,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {15588#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15588#false} is VALID [2022-02-20 19:39:47,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {15588#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {15588#false} is VALID [2022-02-20 19:39:47,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {15588#false} check_#res#1 := check_~tmp~1#1; {15588#false} is VALID [2022-02-20 19:39:47,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {15588#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15588#false} is VALID [2022-02-20 19:39:47,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {15588#false} assume 0 == assert_~arg#1 % 256; {15588#false} is VALID [2022-02-20 19:39:47,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {15588#false} assume !false; {15588#false} is VALID [2022-02-20 19:39:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:47,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:47,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567944171] [2022-02-20 19:39:47,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567944171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:47,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:47,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:47,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605426941] [2022-02-20 19:39:47,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:47,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:39:47,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:47,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:47,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:47,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:47,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:47,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:47,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:47,352 INFO L87 Difference]: Start difference. First operand 1563 states and 2496 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:49,255 INFO L93 Difference]: Finished difference Result 1629 states and 2598 transitions. [2022-02-20 19:39:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:49,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:39:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:49,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:50,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:50,731 INFO L225 Difference]: With dead ends: 1629 [2022-02-20 19:39:50,731 INFO L226 Difference]: Without dead ends: 1593 [2022-02-20 19:39:50,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:50,733 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1485 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:50,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1613 Invalid, 7 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-02-20 19:39:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1591. [2022-02-20 19:39:50,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:50,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.5984896161107616) internal successors, (2540), 1590 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:50,788 INFO L74 IsIncluded]: Start isIncluded. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.5984896161107616) internal successors, (2540), 1590 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:50,790 INFO L87 Difference]: Start difference. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.5984896161107616) internal successors, (2540), 1590 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:50,891 INFO L93 Difference]: Finished difference Result 1593 states and 2541 transitions. [2022-02-20 19:39:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2541 transitions. [2022-02-20 19:39:50,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:50,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:50,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 1591 states, 1589 states have (on average 1.5984896161107616) internal successors, (2540), 1590 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1593 states. [2022-02-20 19:39:50,898 INFO L87 Difference]: Start difference. First operand has 1591 states, 1589 states have (on average 1.5984896161107616) internal successors, (2540), 1590 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1593 states. [2022-02-20 19:39:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:50,990 INFO L93 Difference]: Finished difference Result 1593 states and 2541 transitions. [2022-02-20 19:39:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2541 transitions. [2022-02-20 19:39:50,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:50,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:50,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:50,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1589 states have (on average 1.5984896161107616) internal successors, (2540), 1590 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2540 transitions. [2022-02-20 19:39:51,076 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2540 transitions. Word has length 41 [2022-02-20 19:39:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:51,076 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2540 transitions. [2022-02-20 19:39:51,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2540 transitions. [2022-02-20 19:39:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:51,078 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:51,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:51,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:39:51,078 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027727, now seen corresponding path program 1 times [2022-02-20 19:39:51,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:51,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847590611] [2022-02-20 19:39:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:51,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {22050#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {22050#true} is VALID [2022-02-20 19:39:51,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {22050#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {22050#true} is VALID [2022-02-20 19:39:51,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {22050#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22050#true} is VALID [2022-02-20 19:39:51,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {22050#true} assume 0 == ~r1~0; {22050#true} is VALID [2022-02-20 19:39:51,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {22050#true} assume ~id1~0 >= 0; {22050#true} is VALID [2022-02-20 19:39:51,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {22050#true} assume 0 == ~st1~0; {22052#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:51,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {22052#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {22052#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:51,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {22052#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {22052#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:51,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {22052#(<= ~st1~0 0)} assume ~id2~0 >= 0; {22052#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:51,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {22052#(<= ~st1~0 0)} assume 0 == ~st2~0; {22053#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {22053#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {22053#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {22053#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {22053#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {22053#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {22053#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {22053#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:51,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {22054#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {22051#false} is VALID [2022-02-20 19:39:51,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {22051#false} check_#res#1 := check_~tmp~1#1; {22051#false} is VALID [2022-02-20 19:39:51,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {22051#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22051#false} is VALID [2022-02-20 19:39:51,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {22051#false} assume 0 == assert_~arg#1 % 256; {22051#false} is VALID [2022-02-20 19:39:51,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {22051#false} assume !false; {22051#false} is VALID [2022-02-20 19:39:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:51,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:51,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847590611] [2022-02-20 19:39:51,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847590611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:51,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:51,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:51,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532191568] [2022-02-20 19:39:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:51,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:39:51,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:51,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:51,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:51,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:51,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:51,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:51,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:51,213 INFO L87 Difference]: Start difference. First operand 1591 states and 2540 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:53,762 INFO L93 Difference]: Finished difference Result 1975 states and 3140 transitions. [2022-02-20 19:39:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:39:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:39:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:53,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1853 transitions. [2022-02-20 19:39:55,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1853 edges. 1853 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:55,358 INFO L225 Difference]: With dead ends: 1975 [2022-02-20 19:39:55,359 INFO L226 Difference]: Without dead ends: 1911 [2022-02-20 19:39:55,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:39:55,360 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 4709 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4709 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:55,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4709 Valid, 1779 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-02-20 19:39:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1653. [2022-02-20 19:39:55,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:55,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.5960024227740763) internal successors, (2635), 1652 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,449 INFO L74 IsIncluded]: Start isIncluded. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.5960024227740763) internal successors, (2635), 1652 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,451 INFO L87 Difference]: Start difference. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.5960024227740763) internal successors, (2635), 1652 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:55,606 INFO L93 Difference]: Finished difference Result 1911 states and 3028 transitions. [2022-02-20 19:39:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3028 transitions. [2022-02-20 19:39:55,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:55,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:55,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 1653 states, 1651 states have (on average 1.5960024227740763) internal successors, (2635), 1652 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1911 states. [2022-02-20 19:39:55,614 INFO L87 Difference]: Start difference. First operand has 1653 states, 1651 states have (on average 1.5960024227740763) internal successors, (2635), 1652 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1911 states. [2022-02-20 19:39:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:55,743 INFO L93 Difference]: Finished difference Result 1911 states and 3028 transitions. [2022-02-20 19:39:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3028 transitions. [2022-02-20 19:39:55,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:55,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:55,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:55,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1651 states have (on average 1.5960024227740763) internal successors, (2635), 1652 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2635 transitions. [2022-02-20 19:39:55,830 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2635 transitions. Word has length 41 [2022-02-20 19:39:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:55,830 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2635 transitions. [2022-02-20 19:39:55,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2635 transitions. [2022-02-20 19:39:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:55,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:55,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:55,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:39:55,832 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:55,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1902982177, now seen corresponding path program 1 times [2022-02-20 19:39:55,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:55,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058295079] [2022-02-20 19:39:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:55,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:55,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {29644#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29644#true} is VALID [2022-02-20 19:39:55,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {29644#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {29644#true} is VALID [2022-02-20 19:39:55,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {29644#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29644#true} is VALID [2022-02-20 19:39:55,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {29644#true} assume 0 == ~r1~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {29646#(<= ~r1~0 0)} assume ~id1~0 >= 0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {29646#(<= ~r1~0 0)} assume 0 == ~st1~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {29646#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {29646#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {29646#(<= ~r1~0 0)} assume ~id2~0 >= 0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {29646#(<= ~r1~0 0)} assume 0 == ~st2~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {29646#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {29646#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {29646#(<= ~r1~0 0)} assume ~id3~0 >= 0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {29646#(<= ~r1~0 0)} assume 0 == ~st3~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {29646#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {29646#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {29646#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {29646#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {29646#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {29646#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {29646#(<= ~r1~0 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {29646#(<= ~r1~0 0)} assume !(0 == main1_~i2~0#1); {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {29646#(<= ~r1~0 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {29646#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {29646#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {29646#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {29646#(<= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {29646#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {29646#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {29646#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {29646#(<= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {29646#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {29646#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {29646#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {29646#(<= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {29646#(<= ~r1~0 0)} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {29646#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {29646#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:55,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {29646#(<= ~r1~0 0)} assume ~r1~0 >= 3; {29645#false} is VALID [2022-02-20 19:39:55,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {29645#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {29645#false} is VALID [2022-02-20 19:39:55,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {29645#false} check_#res#1 := check_~tmp~1#1; {29645#false} is VALID [2022-02-20 19:39:55,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {29645#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29645#false} is VALID [2022-02-20 19:39:55,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {29645#false} assume 0 == assert_~arg#1 % 256; {29645#false} is VALID [2022-02-20 19:39:55,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {29645#false} assume !false; {29645#false} is VALID [2022-02-20 19:39:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:55,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:55,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058295079] [2022-02-20 19:39:55,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058295079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:55,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:55,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:55,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247995694] [2022-02-20 19:39:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:55,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:55,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:55,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:55,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:55,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:55,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:55,919 INFO L87 Difference]: Start difference. First operand 1653 states and 2635 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:57,407 INFO L93 Difference]: Finished difference Result 1840 states and 2922 transitions. [2022-02-20 19:39:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:57,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1620 transitions. [2022-02-20 19:39:58,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1620 edges. 1620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:58,721 INFO L225 Difference]: With dead ends: 1840 [2022-02-20 19:39:58,721 INFO L226 Difference]: Without dead ends: 1714 [2022-02-20 19:39:58,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:58,722 INFO L933 BasicCegarLoop]: 1514 mSDtfsCounter, 1469 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:58,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1565 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-02-20 19:39:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1712. [2022-02-20 19:39:58,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:58,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.5923976608187134) internal successors, (2723), 1711 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:58,838 INFO L74 IsIncluded]: Start isIncluded. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.5923976608187134) internal successors, (2723), 1711 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:58,840 INFO L87 Difference]: Start difference. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.5923976608187134) internal successors, (2723), 1711 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:58,969 INFO L93 Difference]: Finished difference Result 1714 states and 2724 transitions. [2022-02-20 19:39:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2724 transitions. [2022-02-20 19:39:58,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:58,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:58,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 1712 states, 1710 states have (on average 1.5923976608187134) internal successors, (2723), 1711 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1714 states. [2022-02-20 19:39:58,977 INFO L87 Difference]: Start difference. First operand has 1712 states, 1710 states have (on average 1.5923976608187134) internal successors, (2723), 1711 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1714 states. [2022-02-20 19:39:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:59,102 INFO L93 Difference]: Finished difference Result 1714 states and 2724 transitions. [2022-02-20 19:39:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2724 transitions. [2022-02-20 19:39:59,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:59,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:59,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:59,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1710 states have (on average 1.5923976608187134) internal successors, (2723), 1711 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2723 transitions. [2022-02-20 19:39:59,209 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2723 transitions. Word has length 43 [2022-02-20 19:39:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:59,209 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2723 transitions. [2022-02-20 19:39:59,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2723 transitions. [2022-02-20 19:39:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:59,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:59,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:59,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:39:59,211 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488665, now seen corresponding path program 1 times [2022-02-20 19:39:59,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:59,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860541608] [2022-02-20 19:39:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:59,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {36747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {36747#true} is VALID [2022-02-20 19:39:59,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {36747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {36747#true} is VALID [2022-02-20 19:39:59,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {36747#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36747#true} is VALID [2022-02-20 19:39:59,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {36747#true} assume 0 == ~r1~0; {36747#true} is VALID [2022-02-20 19:39:59,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {36747#true} assume ~id1~0 >= 0; {36747#true} is VALID [2022-02-20 19:39:59,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {36747#true} assume 0 == ~st1~0; {36749#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:59,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {36749#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {36749#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:59,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {36749#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {36749#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:59,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {36749#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {36749#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:59,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {36749#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {36750#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:59,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {36750#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {36750#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:59,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {36750#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {36750#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:59,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {36750#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {36750#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:59,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {36750#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main1_~i2~0#1); {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:59,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {36751#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {36748#false} is VALID [2022-02-20 19:39:59,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {36748#false} check_#res#1 := check_~tmp~1#1; {36748#false} is VALID [2022-02-20 19:39:59,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {36748#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36748#false} is VALID [2022-02-20 19:39:59,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {36748#false} assume 0 == assert_~arg#1 % 256; {36748#false} is VALID [2022-02-20 19:39:59,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {36748#false} assume !false; {36748#false} is VALID [2022-02-20 19:39:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:59,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:59,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860541608] [2022-02-20 19:39:59,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860541608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:59,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:59,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:59,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015981656] [2022-02-20 19:39:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:59,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:59,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:59,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:59,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:59,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:59,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:59,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:59,388 INFO L87 Difference]: Start difference. First operand 1712 states and 2723 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:01,440 INFO L93 Difference]: Finished difference Result 1897 states and 3005 transitions. [2022-02-20 19:40:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:01,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:40:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:40:01,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1627 transitions. [2022-02-20 19:40:02,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1627 edges. 1627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:02,893 INFO L225 Difference]: With dead ends: 1897 [2022-02-20 19:40:02,893 INFO L226 Difference]: Without dead ends: 1714 [2022-02-20 19:40:02,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:40:02,894 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 1528 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:02,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 1685 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-02-20 19:40:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1712. [2022-02-20 19:40:03,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:03,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.590643274853801) internal successors, (2720), 1711 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:03,023 INFO L74 IsIncluded]: Start isIncluded. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.590643274853801) internal successors, (2720), 1711 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:03,025 INFO L87 Difference]: Start difference. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.590643274853801) internal successors, (2720), 1711 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:03,153 INFO L93 Difference]: Finished difference Result 1714 states and 2721 transitions. [2022-02-20 19:40:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2721 transitions. [2022-02-20 19:40:03,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:03,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:03,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 1712 states, 1710 states have (on average 1.590643274853801) internal successors, (2720), 1711 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1714 states. [2022-02-20 19:40:03,160 INFO L87 Difference]: Start difference. First operand has 1712 states, 1710 states have (on average 1.590643274853801) internal successors, (2720), 1711 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1714 states. [2022-02-20 19:40:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:03,261 INFO L93 Difference]: Finished difference Result 1714 states and 2721 transitions. [2022-02-20 19:40:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2721 transitions. [2022-02-20 19:40:03,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:03,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:03,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:03,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1710 states have (on average 1.590643274853801) internal successors, (2720), 1711 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2720 transitions. [2022-02-20 19:40:03,385 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2720 transitions. Word has length 43 [2022-02-20 19:40:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:03,385 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2720 transitions. [2022-02-20 19:40:03,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2720 transitions. [2022-02-20 19:40:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:03,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:03,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:03,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:40:03,386 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash -47574589, now seen corresponding path program 1 times [2022-02-20 19:40:03,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:03,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573889231] [2022-02-20 19:40:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:03,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:03,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {43922#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {43922#true} is VALID [2022-02-20 19:40:03,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {43922#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {43922#true} is VALID [2022-02-20 19:40:03,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {43922#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {43922#true} is VALID [2022-02-20 19:40:03,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {43922#true} assume 0 == ~r1~0; {43922#true} is VALID [2022-02-20 19:40:03,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {43922#true} assume ~id1~0 >= 0; {43922#true} is VALID [2022-02-20 19:40:03,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {43922#true} assume 0 == ~st1~0; {43922#true} is VALID [2022-02-20 19:40:03,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {43922#true} assume ~send1~0 == ~id1~0; {43922#true} is VALID [2022-02-20 19:40:03,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {43922#true} assume 0 == ~mode1~0 % 256; {43922#true} is VALID [2022-02-20 19:40:03,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {43922#true} assume ~id2~0 >= 0; {43922#true} is VALID [2022-02-20 19:40:03,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {43922#true} assume 0 == ~st2~0; {43922#true} is VALID [2022-02-20 19:40:03,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {43922#true} assume ~send2~0 == ~id2~0; {43922#true} is VALID [2022-02-20 19:40:03,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {43922#true} assume 0 == ~mode2~0 % 256; {43922#true} is VALID [2022-02-20 19:40:03,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {43922#true} assume ~id3~0 >= 0; {43922#true} is VALID [2022-02-20 19:40:03,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {43922#true} assume 0 == ~st3~0; {43922#true} is VALID [2022-02-20 19:40:03,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {43922#true} assume ~send3~0 == ~id3~0; {43922#true} is VALID [2022-02-20 19:40:03,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {43922#true} assume 0 == ~mode3~0 % 256; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:03,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {43924#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {43923#false} is VALID [2022-02-20 19:40:03,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {43923#false} assume node3_~m3~0#1 != ~nomsg~0; {43923#false} is VALID [2022-02-20 19:40:03,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {43923#false} assume !(node3_~m3~0#1 > ~id3~0); {43923#false} is VALID [2022-02-20 19:40:03,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {43923#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {43923#false} is VALID [2022-02-20 19:40:03,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {43923#false} ~mode3~0 := 0; {43923#false} is VALID [2022-02-20 19:40:03,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {43923#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {43923#false} is VALID [2022-02-20 19:40:03,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {43923#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {43923#false} is VALID [2022-02-20 19:40:03,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {43923#false} check_#res#1 := check_~tmp~1#1; {43923#false} is VALID [2022-02-20 19:40:03,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {43923#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {43923#false} is VALID [2022-02-20 19:40:03,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {43923#false} assume 0 == assert_~arg#1 % 256; {43923#false} is VALID [2022-02-20 19:40:03,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {43923#false} assume !false; {43923#false} is VALID [2022-02-20 19:40:03,445 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:40:03,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:03,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573889231] [2022-02-20 19:40:03,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573889231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:03,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:03,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:03,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750293655] [2022-02-20 19:40:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:03,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:03,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:03,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:03,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:03,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:03,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:03,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:03,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:03,475 INFO L87 Difference]: Start difference. First operand 1712 states and 2720 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:05,407 INFO L93 Difference]: Finished difference Result 2042 states and 3216 transitions. [2022-02-20 19:40:05,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:05,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:05,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:40:06,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:06,928 INFO L225 Difference]: With dead ends: 2042 [2022-02-20 19:40:06,929 INFO L226 Difference]: Without dead ends: 1859 [2022-02-20 19:40:06,929 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:40:06,930 INFO L933 BasicCegarLoop]: 1541 mSDtfsCounter, 1477 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:06,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 1603 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-02-20 19:40:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1857. [2022-02-20 19:40:07,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:07,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.5800539083557952) internal successors, (2931), 1856 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:07,144 INFO L74 IsIncluded]: Start isIncluded. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.5800539083557952) internal successors, (2931), 1856 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:07,147 INFO L87 Difference]: Start difference. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.5800539083557952) internal successors, (2931), 1856 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:07,295 INFO L93 Difference]: Finished difference Result 1859 states and 2932 transitions. [2022-02-20 19:40:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2932 transitions. [2022-02-20 19:40:07,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:07,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:07,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 1857 states, 1855 states have (on average 1.5800539083557952) internal successors, (2931), 1856 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1859 states. [2022-02-20 19:40:07,303 INFO L87 Difference]: Start difference. First operand has 1857 states, 1855 states have (on average 1.5800539083557952) internal successors, (2931), 1856 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1859 states. [2022-02-20 19:40:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:07,450 INFO L93 Difference]: Finished difference Result 1859 states and 2932 transitions. [2022-02-20 19:40:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2932 transitions. [2022-02-20 19:40:07,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:07,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:07,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:07,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1855 states have (on average 1.5800539083557952) internal successors, (2931), 1856 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2931 transitions. [2022-02-20 19:40:07,613 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2931 transitions. Word has length 43 [2022-02-20 19:40:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:07,614 INFO L470 AbstractCegarLoop]: Abstraction has 1857 states and 2931 transitions. [2022-02-20 19:40:07,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2931 transitions. [2022-02-20 19:40:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:07,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:07,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:07,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:40:07,615 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1199933027, now seen corresponding path program 1 times [2022-02-20 19:40:07,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:07,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911934056] [2022-02-20 19:40:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:07,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:07,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {51743#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {51743#true} is VALID [2022-02-20 19:40:07,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {51743#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {51743#true} is VALID [2022-02-20 19:40:07,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {51743#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {51743#true} is VALID [2022-02-20 19:40:07,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {51743#true} assume 0 == ~r1~0; {51743#true} is VALID [2022-02-20 19:40:07,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {51743#true} assume ~id1~0 >= 0; {51743#true} is VALID [2022-02-20 19:40:07,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {51743#true} assume 0 == ~st1~0; {51743#true} is VALID [2022-02-20 19:40:07,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {51743#true} assume ~send1~0 == ~id1~0; {51743#true} is VALID [2022-02-20 19:40:07,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {51743#true} assume 0 == ~mode1~0 % 256; {51743#true} is VALID [2022-02-20 19:40:07,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {51743#true} assume ~id2~0 >= 0; {51743#true} is VALID [2022-02-20 19:40:07,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {51743#true} assume 0 == ~st2~0; {51743#true} is VALID [2022-02-20 19:40:07,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {51743#true} assume ~send2~0 == ~id2~0; {51743#true} is VALID [2022-02-20 19:40:07,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {51743#true} assume 0 == ~mode2~0 % 256; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:07,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {51745#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {51744#false} is VALID [2022-02-20 19:40:07,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {51744#false} assume node2_~m2~0#1 != ~nomsg~0; {51744#false} is VALID [2022-02-20 19:40:07,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {51744#false} assume !(node2_~m2~0#1 > ~id2~0); {51744#false} is VALID [2022-02-20 19:40:07,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {51744#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {51744#false} is VALID [2022-02-20 19:40:07,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {51744#false} ~mode2~0 := 0; {51744#false} is VALID [2022-02-20 19:40:07,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {51744#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; {51744#false} is VALID [2022-02-20 19:40:07,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {51744#false} assume !(0 != ~mode3~0 % 256); {51744#false} is VALID [2022-02-20 19:40:07,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {51744#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {51744#false} is VALID [2022-02-20 19:40:07,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {51744#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; {51744#false} is VALID [2022-02-20 19:40:07,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {51744#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {51744#false} is VALID [2022-02-20 19:40:07,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {51744#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {51744#false} is VALID [2022-02-20 19:40:07,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {51744#false} check_#res#1 := check_~tmp~1#1; {51744#false} is VALID [2022-02-20 19:40:07,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {51744#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {51744#false} is VALID [2022-02-20 19:40:07,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {51744#false} assume 0 == assert_~arg#1 % 256; {51744#false} is VALID [2022-02-20 19:40:07,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {51744#false} assume !false; {51744#false} is VALID [2022-02-20 19:40:07,680 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:40:07,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:07,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911934056] [2022-02-20 19:40:07,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911934056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:07,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:07,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:07,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860249131] [2022-02-20 19:40:07,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:07,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:07,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:07,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:07,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:07,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:07,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:07,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:07,716 INFO L87 Difference]: Start difference. First operand 1857 states and 2931 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)