./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 229b91e3de975681c9279ff5877f98d2e4ca4fb1a04c4bc6189640654fad2f3e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:44:14,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:44:14,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:44:14,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:44:14,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:44:14,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:44:14,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:44:14,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:44:14,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:44:14,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:44:14,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:44:14,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:44:14,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:44:14,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:44:14,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:44:14,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:44:14,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:44:14,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:44:14,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:44:14,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:44:14,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:44:14,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:44:14,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:44:14,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:44:14,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:44:14,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:44:14,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:44:14,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:44:14,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:44:14,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:44:14,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:44:14,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:44:14,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:44:14,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:44:14,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:44:14,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:44:14,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:44:14,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:44:14,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:44:14,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:44:14,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:44:14,405 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:44:14,431 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:44:14,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:44:14,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:44:14,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:44:14,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:44:14,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:44:14,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:44:14,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:44:14,434 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:44:14,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:44:14,435 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:44:14,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:44:14,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:44:14,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:44:14,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:44:14,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:44:14,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:44:14,436 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:44:14,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:44:14,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:44:14,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:44:14,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:44:14,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:44:14,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:44:14,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:14,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:44:14,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:44:14,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:44:14,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:44:14,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:44:14,438 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:44:14,438 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:44:14,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:44:14,439 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 -> 229b91e3de975681c9279ff5877f98d2e4ca4fb1a04c4bc6189640654fad2f3e [2022-02-20 19:44:14,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:44:14,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:44:14,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:44:14,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:44:14,659 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:44:14,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c [2022-02-20 19:44:14,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae77ccc7/5b5327dbbbe748fda4666a216a319067/FLAGb91198bf3 [2022-02-20 19:44:15,262 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:44:15,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c [2022-02-20 19:44:15,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae77ccc7/5b5327dbbbe748fda4666a216a319067/FLAGb91198bf3 [2022-02-20 19:44:15,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae77ccc7/5b5327dbbbe748fda4666a216a319067 [2022-02-20 19:44:15,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:44:15,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:44:15,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:15,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:44:15,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:44:15,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:15" (1/1) ... [2022-02-20 19:44:15,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74848b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:15, skipping insertion in model container [2022-02-20 19:44:15,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:15" (1/1) ... [2022-02-20 19:44:15,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:44:15,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:44:16,154 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.5.ufo.BOUNDED-10.pals+Problem12_label02.c[11640,11653] [2022-02-20 19:44:16,204 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.5.ufo.BOUNDED-10.pals+Problem12_label02.c[18930,18943] [2022-02-20 19:44:16,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:16,765 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:44:16,815 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.5.ufo.BOUNDED-10.pals+Problem12_label02.c[11640,11653] [2022-02-20 19:44:16,829 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.5.ufo.BOUNDED-10.pals+Problem12_label02.c[18930,18943] [2022-02-20 19:44:17,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:17,162 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:44:17,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17 WrapperNode [2022-02-20 19:44:17,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:17,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:17,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:44:17,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:44:17,169 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:44:17" (1/1) ... [2022-02-20 19:44:17,214 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:44:17" (1/1) ... [2022-02-20 19:44:17,543 INFO L137 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5090 [2022-02-20 19:44:17,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:17,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:44:17,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:44:17,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:44:17,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17" (1/1) ... [2022-02-20 19:44:17,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17" (1/1) ... [2022-02-20 19:44:17,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17" (1/1) ... [2022-02-20 19:44:17,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17" (1/1) ... [2022-02-20 19:44:17,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17" (1/1) ... [2022-02-20 19:44:17,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17" (1/1) ... [2022-02-20 19:44:17,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17" (1/1) ... [2022-02-20 19:44:17,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:44:17,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:44:17,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:44:17,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:44: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:44:17" (1/1) ... [2022-02-20 19:44:17,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:44:17,972 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:44:17,973 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:44:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:44:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:44:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:44:18,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:44:18,148 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:44:18,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:44:25,001 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:44:25,024 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:44:25,025 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:44:25,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:25 BoogieIcfgContainer [2022-02-20 19:44:25,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:44:25,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:44:25,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:44:25,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:44:25,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:44:15" (1/3) ... [2022-02-20 19:44:25,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c345c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:25, skipping insertion in model container [2022-02-20 19:44:25,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:17" (2/3) ... [2022-02-20 19:44:25,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c345c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:25, skipping insertion in model container [2022-02-20 19:44:25,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:25" (3/3) ... [2022-02-20 19:44:25,032 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c [2022-02-20 19:44:25,035 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:44:25,036 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:44:25,079 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:44:25,095 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:44:25,095 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:44:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:44:25,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:25,134 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] [2022-02-20 19:44:25,134 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash -441366565, now seen corresponding path program 1 times [2022-02-20 19:44:25,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:25,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566828576] [2022-02-20 19:44:25,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:25,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:25,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {912#true} is VALID [2022-02-20 19:44:25,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {912#true} is VALID [2022-02-20 19:44:25,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#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~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:44:25,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {912#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {912#true} is VALID [2022-02-20 19:44:25,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {912#true} init_#res#1 := init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:44:25,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {912#true} is VALID [2022-02-20 19:44:25,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {913#false} is VALID [2022-02-20 19:44:25,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {913#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {913#false} is VALID [2022-02-20 19:44:25,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#false} assume !!(main1_~i2~0#1 < 10);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; {913#false} is VALID [2022-02-20 19:44:25,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:25,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#false} assume !(node1_~m1~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:25,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~mode1~0 := 0; {913#false} is VALID [2022-02-20 19:44:25,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:44:25,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:25,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !(node2_~m2~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:25,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} ~mode2~0 := 0; {913#false} is VALID [2022-02-20 19:44:25,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:44:25,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:25,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !(node3_~m3~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:25,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {913#false} ~mode3~0 := 0; {913#false} is VALID [2022-02-20 19:44:25,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:25,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:25,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !(node4_~m4~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:25,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {913#false} ~mode4~0 := 0; {913#false} is VALID [2022-02-20 19:44:25,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:25,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {913#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:25,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {913#false} assume !(node5_~m5~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:25,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {913#false} ~mode5~0 := 0; {913#false} is VALID [2022-02-20 19:44:25,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {913#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:44:25,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {913#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {913#false} is VALID [2022-02-20 19:44:25,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#false} check_#res#1 := check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:44:25,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {913#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {913#false} is VALID [2022-02-20 19:44:25,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#false} assume 0 == assert_~arg#1 % 256; {913#false} is VALID [2022-02-20 19:44:25,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-02-20 19:44:25,325 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:44:25,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:25,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566828576] [2022-02-20 19:44:25,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566828576] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:25,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:25,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:44:25,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478368280] [2022-02-20 19:44:25,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:25,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:44:25,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:25,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:25,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:25,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:44:25,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:44:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:44:25,379 INFO L87 Difference]: Start difference. First operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:26,559 INFO L93 Difference]: Finished difference Result 1781 states and 3374 transitions. [2022-02-20 19:44:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:44:26,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:44:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3374 transitions. [2022-02-20 19:44:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3374 transitions. [2022-02-20 19:44:26,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3374 transitions. [2022-02-20 19:44:29,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3374 edges. 3374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:29,200 INFO L225 Difference]: With dead ends: 1781 [2022-02-20 19:44:29,200 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:44:29,207 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:44:29,210 INFO L933 BasicCegarLoop]: 1656 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, 1656 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:44:29,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:44:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:44:29,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:29,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:29,277 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:29,278 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:29,304 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:44:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:29,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:29,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:29,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:44:29,316 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:44:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:29,342 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:44:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:29,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:29,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:29,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:29,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1589 transitions. [2022-02-20 19:44:29,377 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1589 transitions. Word has length 34 [2022-02-20 19:44:29,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:29,378 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1589 transitions. [2022-02-20 19:44:29,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:29,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:44:29,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:29,379 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] [2022-02-20 19:44:29,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:44:29,379 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash -950839655, now seen corresponding path program 1 times [2022-02-20 19:44:29,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:29,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88775712] [2022-02-20 19:44:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:29,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {5271#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {5271#true} is VALID [2022-02-20 19:44:29,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {5271#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {5271#true} is VALID [2022-02-20 19:44:29,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {5271#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#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~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5271#true} is VALID [2022-02-20 19:44:29,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {5271#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5273#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:44:29,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {5273#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5274#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:44:29,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {5274#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5275#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:44:29,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {5275#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5272#false} is VALID [2022-02-20 19:44:29,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {5272#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5272#false} is VALID [2022-02-20 19:44:29,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {5272#false} assume !!(main1_~i2~0#1 < 10);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; {5272#false} is VALID [2022-02-20 19:44:29,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {5272#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:29,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {5272#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:29,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {5272#false} ~mode1~0 := 0; {5272#false} is VALID [2022-02-20 19:44:29,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:29,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {5272#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:29,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {5272#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:29,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {5272#false} ~mode2~0 := 0; {5272#false} is VALID [2022-02-20 19:44:29,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {5272#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; {5272#false} is VALID [2022-02-20 19:44:29,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {5272#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:29,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {5272#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:29,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {5272#false} ~mode3~0 := 0; {5272#false} is VALID [2022-02-20 19:44:29,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {5272#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:29,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {5272#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:29,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {5272#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:29,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {5272#false} ~mode4~0 := 0; {5272#false} is VALID [2022-02-20 19:44:29,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {5272#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:29,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {5272#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:29,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {5272#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:29,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {5272#false} ~mode5~0 := 0; {5272#false} is VALID [2022-02-20 19:44:29,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {5272#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5272#false} is VALID [2022-02-20 19:44:29,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {5272#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5272#false} is VALID [2022-02-20 19:44:29,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {5272#false} check_#res#1 := check_~tmp~1#1; {5272#false} is VALID [2022-02-20 19:44:29,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {5272#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {5272#false} is VALID [2022-02-20 19:44:29,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {5272#false} assume 0 == assert_~arg#1 % 256; {5272#false} is VALID [2022-02-20 19:44:29,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {5272#false} assume !false; {5272#false} is VALID [2022-02-20 19:44:29,494 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:44:29,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:29,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88775712] [2022-02-20 19:44:29,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88775712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:29,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:29,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:44:29,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596737054] [2022-02-20 19:44:29,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:44:29,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:29,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:29,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:29,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:44:29,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:44:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:44:29,520 INFO L87 Difference]: Start difference. First operand 843 states and 1589 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:33,466 INFO L93 Difference]: Finished difference Result 899 states and 1675 transitions. [2022-02-20 19:44:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:44:33,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:44:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:44:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:44:33,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1675 transitions. [2022-02-20 19:44:34,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:34,686 INFO L225 Difference]: With dead ends: 899 [2022-02-20 19:44:34,686 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:44:34,687 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:44:34,688 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 3 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6314 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:34,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6314 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:44:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:44:34,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:34,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:34,704 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:34,705 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:34,728 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:44:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:34,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:34,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:34,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:44:34,732 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:44:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:34,755 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:44:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:34,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:34,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:34,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:34,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1558 transitions. [2022-02-20 19:44:34,780 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1558 transitions. Word has length 34 [2022-02-20 19:44:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:34,781 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1558 transitions. [2022-02-20 19:44:34,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 19:44:34,782 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:34,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:34,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:44:34,782 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:34,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:34,783 INFO L85 PathProgramCache]: Analyzing trace with hash 383168621, now seen corresponding path program 1 times [2022-02-20 19:44:34,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:34,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152926419] [2022-02-20 19:44:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:34,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:34,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {8747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet48#1);havoc main_#t~nondet48#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet46#1, main2_#t~ret47#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet46#1 && main2_#t~nondet46#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet46#1;havoc main2_#t~nondet46#1; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret43#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,968 INFO L290 TraceCheckUtils]: 50: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,968 INFO L290 TraceCheckUtils]: 51: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,977 INFO L290 TraceCheckUtils]: 55: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:34,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8750#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:44:34,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {8750#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8750#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:44:34,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {8750#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8750#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:44:34,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {8750#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8750#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:44:34,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {8750#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8750#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:44:34,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {8750#(not (= 0 (+ (- 13) ~a24~0)))} assume (((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8748#false} is VALID [2022-02-20 19:44:34,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {8748#false} assume !false; {8748#false} is VALID [2022-02-20 19:44:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:44:34,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:34,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152926419] [2022-02-20 19:44:34,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152926419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:34,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:34,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:34,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342061714] [2022-02-20 19:44:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:35,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 19:44:35,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:35,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:35,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:35,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:44:35,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:44:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:44:35,052 INFO L87 Difference]: Start difference. First operand 843 states and 1558 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:46,483 INFO L93 Difference]: Finished difference Result 3098 states and 5867 transitions. [2022-02-20 19:44:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:44:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 19:44:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5867 transitions. [2022-02-20 19:44:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5867 transitions. [2022-02-20 19:44:46,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5867 transitions. [2022-02-20 19:44:50,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5867 edges. 5867 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:51,108 INFO L225 Difference]: With dead ends: 3098 [2022-02-20 19:44:51,108 INFO L226 Difference]: Without dead ends: 2345 [2022-02-20 19:44:51,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:44:51,109 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 2426 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2426 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 6404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1250 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:51,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2426 Valid, 830 Invalid, 6404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1250 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-02-20 19:44:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2022-02-20 19:44:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2345. [2022-02-20 19:44:51,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:51,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5083226632522406) internal successors, (3534), 2344 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:51,156 INFO L74 IsIncluded]: Start isIncluded. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5083226632522406) internal successors, (3534), 2344 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:51,160 INFO L87 Difference]: Start difference. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5083226632522406) internal successors, (3534), 2344 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:51,307 INFO L93 Difference]: Finished difference Result 2345 states and 3534 transitions. [2022-02-20 19:44:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3534 transitions. [2022-02-20 19:44:51,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:51,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:51,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 2345 states, 2343 states have (on average 1.5083226632522406) internal successors, (3534), 2344 states have internal predecessors, (3534), 0 states have call successors, (0), 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 2345 states. [2022-02-20 19:44:51,318 INFO L87 Difference]: Start difference. First operand has 2345 states, 2343 states have (on average 1.5083226632522406) internal successors, (3534), 2344 states have internal predecessors, (3534), 0 states have call successors, (0), 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 2345 states. [2022-02-20 19:44:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:51,472 INFO L93 Difference]: Finished difference Result 2345 states and 3534 transitions. [2022-02-20 19:44:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3534 transitions. [2022-02-20 19:44:51,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:51,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:51,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:51,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2343 states have (on average 1.5083226632522406) internal successors, (3534), 2344 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3534 transitions. [2022-02-20 19:44:51,670 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3534 transitions. Word has length 63 [2022-02-20 19:44:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:51,671 INFO L470 AbstractCegarLoop]: Abstraction has 2345 states and 3534 transitions. [2022-02-20 19:44:51,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3534 transitions. [2022-02-20 19:44:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:51,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:51,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:51,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:44:51,674 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash -695028240, now seen corresponding path program 1 times [2022-02-20 19:44:51,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:51,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984377453] [2022-02-20 19:44:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:51,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:51,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {18941#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {18941#true} is VALID [2022-02-20 19:44:51,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {18941#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {18941#true} is VALID [2022-02-20 19:44:51,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {18941#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#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~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {18941#true} is VALID [2022-02-20 19:44:51,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {18941#true} assume 0 == ~r1~0; {18941#true} is VALID [2022-02-20 19:44:51,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {18941#true} assume ~id1~0 >= 0; {18941#true} is VALID [2022-02-20 19:44:51,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {18941#true} assume 0 == ~st1~0; {18941#true} is VALID [2022-02-20 19:44:51,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {18941#true} assume ~send1~0 == ~id1~0; {18941#true} is VALID [2022-02-20 19:44:51,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {18941#true} assume 0 == ~mode1~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:51,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {18943#(= (+ (* (- 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:44:51,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {18942#false} assume !(node1_~m1~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:44:51,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {18942#false} ~mode1~0 := 0; {18942#false} is VALID [2022-02-20 19:44:51,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {18942#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; {18942#false} is VALID [2022-02-20 19:44:51,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {18942#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:44:51,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {18942#false} assume !(node2_~m2~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:44:51,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {18942#false} ~mode2~0 := 0; {18942#false} is VALID [2022-02-20 19:44:51,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {18942#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; {18942#false} is VALID [2022-02-20 19:44:51,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {18942#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:44:51,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {18942#false} assume !(node3_~m3~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:44:51,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {18942#false} ~mode3~0 := 0; {18942#false} is VALID [2022-02-20 19:44:51,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {18942#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:44:51,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {18942#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:44:51,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {18942#false} assume !(node4_~m4~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:44:51,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {18942#false} ~mode4~0 := 0; {18942#false} is VALID [2022-02-20 19:44:51,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {18942#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:44:51,776 INFO L290 TraceCheckUtils]: 55: Hoare triple {18942#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:44:51,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {18942#false} assume !(node5_~m5~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:44:51,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {18942#false} ~mode5~0 := 0; {18942#false} is VALID [2022-02-20 19:44:51,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {18942#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {18942#false} is VALID [2022-02-20 19:44:51,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {18942#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {18942#false} is VALID [2022-02-20 19:44:51,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {18942#false} check_#res#1 := check_~tmp~1#1; {18942#false} is VALID [2022-02-20 19:44:51,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {18942#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {18942#false} is VALID [2022-02-20 19:44:51,778 INFO L290 TraceCheckUtils]: 62: Hoare triple {18942#false} assume 0 == assert_~arg#1 % 256; {18942#false} is VALID [2022-02-20 19:44:51,778 INFO L290 TraceCheckUtils]: 63: Hoare triple {18942#false} assume !false; {18942#false} is VALID [2022-02-20 19:44:51,778 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:44:51,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:51,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984377453] [2022-02-20 19:44:51,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984377453] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:51,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:51,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:51,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825327522] [2022-02-20 19:44:51,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:51,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:44:51,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:51,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:51,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:51,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:51,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:51,817 INFO L87 Difference]: Start difference. First operand 2345 states and 3534 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:53,581 INFO L93 Difference]: Finished difference Result 2443 states and 3688 transitions. [2022-02-20 19:44:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:44:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:53,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:54,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:55,121 INFO L225 Difference]: With dead ends: 2443 [2022-02-20 19:44:55,121 INFO L226 Difference]: Without dead ends: 2391 [2022-02-20 19:44:55,121 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:44:55,122 INFO L933 BasicCegarLoop]: 1626 mSDtfsCounter, 1511 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1706 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:44:55,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1706 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2022-02-20 19:44:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2389. [2022-02-20 19:44:55,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:55,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5098449937159615) internal successors, (3604), 2388 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:55,176 INFO L74 IsIncluded]: Start isIncluded. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5098449937159615) internal successors, (3604), 2388 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:55,178 INFO L87 Difference]: Start difference. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5098449937159615) internal successors, (3604), 2388 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:55,318 INFO L93 Difference]: Finished difference Result 2391 states and 3605 transitions. [2022-02-20 19:44:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3605 transitions. [2022-02-20 19:44:55,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:55,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:55,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 2389 states, 2387 states have (on average 1.5098449937159615) internal successors, (3604), 2388 states have internal predecessors, (3604), 0 states have call successors, (0), 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 2391 states. [2022-02-20 19:44:55,332 INFO L87 Difference]: Start difference. First operand has 2389 states, 2387 states have (on average 1.5098449937159615) internal successors, (3604), 2388 states have internal predecessors, (3604), 0 states have call successors, (0), 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 2391 states. [2022-02-20 19:44:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:55,470 INFO L93 Difference]: Finished difference Result 2391 states and 3605 transitions. [2022-02-20 19:44:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3605 transitions. [2022-02-20 19:44:55,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:55,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:55,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:55,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2387 states have (on average 1.5098449937159615) internal successors, (3604), 2388 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3604 transitions. [2022-02-20 19:44:55,620 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3604 transitions. Word has length 64 [2022-02-20 19:44:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:55,621 INFO L470 AbstractCegarLoop]: Abstraction has 2389 states and 3604 transitions. [2022-02-20 19:44:55,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3604 transitions. [2022-02-20 19:44:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:55,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:55,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:55,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:44:55,622 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1440610970, now seen corresponding path program 1 times [2022-02-20 19:44:55,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:55,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142283932] [2022-02-20 19:44:55,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:55,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:55,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {28632#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {28632#true} is VALID [2022-02-20 19:44:55,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {28632#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {28632#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#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~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {28632#true} assume 0 == ~r1~0; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {28632#true} assume ~id1~0 >= 0; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {28632#true} assume 0 == ~st1~0; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {28632#true} assume ~send1~0 == ~id1~0; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {28632#true} assume 0 == ~mode1~0 % 256; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {28632#true} assume ~id2~0 >= 0; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {28632#true} assume 0 == ~st2~0; {28632#true} is VALID [2022-02-20 19:44:55,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {28632#true} assume ~send2~0 == ~id2~0; {28632#true} is VALID [2022-02-20 19:44:55,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {28632#true} assume 0 == ~mode2~0 % 256; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {28634#(= (+ (* (- 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; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {28634#(= (+ (* (- 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; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:55,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {28634#(= (+ (* (- 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; {28633#false} is VALID [2022-02-20 19:44:55,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {28633#false} assume !(node2_~m2~0#1 != ~nomsg~0); {28633#false} is VALID [2022-02-20 19:44:55,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {28633#false} ~mode2~0 := 0; {28633#false} is VALID [2022-02-20 19:44:55,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {28633#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; {28633#false} is VALID [2022-02-20 19:44:55,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {28633#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:44:55,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {28633#false} assume !(node3_~m3~0#1 != ~nomsg~0); {28633#false} is VALID [2022-02-20 19:44:55,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {28633#false} ~mode3~0 := 0; {28633#false} is VALID [2022-02-20 19:44:55,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {28633#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:44:55,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {28633#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:44:55,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {28633#false} assume !(node4_~m4~0#1 != ~nomsg~0); {28633#false} is VALID [2022-02-20 19:44:55,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {28633#false} ~mode4~0 := 0; {28633#false} is VALID [2022-02-20 19:44:55,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {28633#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:44:55,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {28633#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:44:55,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {28633#false} assume !(node5_~m5~0#1 != ~nomsg~0); {28633#false} is VALID [2022-02-20 19:44:55,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {28633#false} ~mode5~0 := 0; {28633#false} is VALID [2022-02-20 19:44:55,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {28633#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28633#false} is VALID [2022-02-20 19:44:55,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {28633#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {28633#false} is VALID [2022-02-20 19:44:55,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {28633#false} check_#res#1 := check_~tmp~1#1; {28633#false} is VALID [2022-02-20 19:44:55,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {28633#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {28633#false} is VALID [2022-02-20 19:44:55,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {28633#false} assume 0 == assert_~arg#1 % 256; {28633#false} is VALID [2022-02-20 19:44:55,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {28633#false} assume !false; {28633#false} is VALID [2022-02-20 19:44:55,734 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:44:55,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:55,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142283932] [2022-02-20 19:44:55,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142283932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:55,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:55,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:55,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220863347] [2022-02-20 19:44:55,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:55,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:44:55,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:55,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:55,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:55,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:55,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:55,774 INFO L87 Difference]: Start difference. First operand 2389 states and 3604 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:57,633 INFO L93 Difference]: Finished difference Result 2569 states and 3888 transitions. [2022-02-20 19:44:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:57,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:44:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:57,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:59,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:59,198 INFO L225 Difference]: With dead ends: 2569 [2022-02-20 19:44:59,198 INFO L226 Difference]: Without dead ends: 2473 [2022-02-20 19:44:59,198 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:44:59,200 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 1507 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1705 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:44:59,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1705 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2022-02-20 19:44:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2471. [2022-02-20 19:44:59,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:59,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5119481571486433) internal successors, (3733), 2470 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:59,263 INFO L74 IsIncluded]: Start isIncluded. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5119481571486433) internal successors, (3733), 2470 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:59,264 INFO L87 Difference]: Start difference. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5119481571486433) internal successors, (3733), 2470 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:59,406 INFO L93 Difference]: Finished difference Result 2473 states and 3734 transitions. [2022-02-20 19:44:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3734 transitions. [2022-02-20 19:44:59,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:59,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:59,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 2471 states, 2469 states have (on average 1.5119481571486433) internal successors, (3733), 2470 states have internal predecessors, (3733), 0 states have call successors, (0), 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 2473 states. [2022-02-20 19:44:59,413 INFO L87 Difference]: Start difference. First operand has 2471 states, 2469 states have (on average 1.5119481571486433) internal successors, (3733), 2470 states have internal predecessors, (3733), 0 states have call successors, (0), 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 2473 states. [2022-02-20 19:44:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:59,557 INFO L93 Difference]: Finished difference Result 2473 states and 3734 transitions. [2022-02-20 19:44:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3734 transitions. [2022-02-20 19:44:59,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:59,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:59,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:59,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2469 states have (on average 1.5119481571486433) internal successors, (3733), 2470 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3733 transitions. [2022-02-20 19:44:59,715 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3733 transitions. Word has length 64 [2022-02-20 19:44:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:59,715 INFO L470 AbstractCegarLoop]: Abstraction has 2471 states and 3733 transitions. [2022-02-20 19:44:59,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3733 transitions. [2022-02-20 19:44:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:59,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:59,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:59,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:44:59,716 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 914325468, now seen corresponding path program 1 times [2022-02-20 19:44:59,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:59,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744831227] [2022-02-20 19:44:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:59,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {38735#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {38735#true} is VALID [2022-02-20 19:44:59,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {38735#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {38735#true} is VALID [2022-02-20 19:44:59,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {38735#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#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~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38735#true} is VALID [2022-02-20 19:44:59,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {38735#true} assume 0 == ~r1~0; {38735#true} is VALID [2022-02-20 19:44:59,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {38735#true} assume ~id1~0 >= 0; {38735#true} is VALID [2022-02-20 19:44:59,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {38735#true} assume 0 == ~st1~0; {38735#true} is VALID [2022-02-20 19:44:59,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {38735#true} assume ~send1~0 == ~id1~0; {38735#true} is VALID [2022-02-20 19:44:59,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {38735#true} assume 0 == ~mode1~0 % 256; {38735#true} is VALID [2022-02-20 19:44:59,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {38735#true} assume ~id2~0 >= 0; {38735#true} is VALID [2022-02-20 19:44:59,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {38735#true} assume 0 == ~st2~0; {38735#true} is VALID [2022-02-20 19:44:59,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {38735#true} assume ~send2~0 == ~id2~0; {38735#true} is VALID [2022-02-20 19:44:59,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {38735#true} assume 0 == ~mode2~0 % 256; {38735#true} is VALID [2022-02-20 19:44:59,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {38735#true} assume ~id3~0 >= 0; {38735#true} is VALID [2022-02-20 19:44:59,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {38735#true} assume 0 == ~st3~0; {38735#true} is VALID [2022-02-20 19:44:59,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {38735#true} assume ~send3~0 == ~id3~0; {38735#true} is VALID [2022-02-20 19:44:59,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {38735#true} assume 0 == ~mode3~0 % 256; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {38737#(= (+ (* (- 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; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {38737#(= (+ (* (- 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; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {38737#(= (+ (* (- 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; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {38737#(= (+ (* (- 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; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:59,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {38737#(= (+ (* (- 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; {38736#false} is VALID [2022-02-20 19:44:59,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {38736#false} assume !(node3_~m3~0#1 != ~nomsg~0); {38736#false} is VALID [2022-02-20 19:44:59,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {38736#false} ~mode3~0 := 0; {38736#false} is VALID [2022-02-20 19:44:59,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {38736#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:44:59,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {38736#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:44:59,779 INFO L290 TraceCheckUtils]: 52: Hoare triple {38736#false} assume !(node4_~m4~0#1 != ~nomsg~0); {38736#false} is VALID [2022-02-20 19:44:59,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {38736#false} ~mode4~0 := 0; {38736#false} is VALID [2022-02-20 19:44:59,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {38736#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:44:59,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {38736#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:44:59,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {38736#false} assume !(node5_~m5~0#1 != ~nomsg~0); {38736#false} is VALID [2022-02-20 19:44:59,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {38736#false} ~mode5~0 := 0; {38736#false} is VALID [2022-02-20 19:44:59,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {38736#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38736#false} is VALID [2022-02-20 19:44:59,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {38736#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {38736#false} is VALID [2022-02-20 19:44:59,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {38736#false} check_#res#1 := check_~tmp~1#1; {38736#false} is VALID [2022-02-20 19:44:59,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {38736#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {38736#false} is VALID [2022-02-20 19:44:59,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {38736#false} assume 0 == assert_~arg#1 % 256; {38736#false} is VALID [2022-02-20 19:44:59,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {38736#false} assume !false; {38736#false} is VALID [2022-02-20 19:44:59,781 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:44:59,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:59,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744831227] [2022-02-20 19:44:59,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744831227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:59,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:59,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:59,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529849282] [2022-02-20 19:44:59,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:44:59,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:59,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:59,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:59,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:59,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:59,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:59,827 INFO L87 Difference]: Start difference. First operand 2471 states and 3733 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:01,686 INFO L93 Difference]: Finished difference Result 2803 states and 4255 transitions. [2022-02-20 19:45:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:01,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:01,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:45:03,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:03,292 INFO L225 Difference]: With dead ends: 2803 [2022-02-20 19:45:03,292 INFO L226 Difference]: Without dead ends: 2625 [2022-02-20 19:45:03,293 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:45:03,293 INFO L933 BasicCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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:45:03,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2022-02-20 19:45:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2623. [2022-02-20 19:45:03,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:03,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.5143075162151851) internal successors, (3969), 2622 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:03,382 INFO L74 IsIncluded]: Start isIncluded. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.5143075162151851) internal successors, (3969), 2622 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:03,384 INFO L87 Difference]: Start difference. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.5143075162151851) internal successors, (3969), 2622 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:03,551 INFO L93 Difference]: Finished difference Result 2625 states and 3970 transitions. [2022-02-20 19:45:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3970 transitions. [2022-02-20 19:45:03,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:03,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:03,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 2623 states, 2621 states have (on average 1.5143075162151851) internal successors, (3969), 2622 states have internal predecessors, (3969), 0 states have call successors, (0), 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 2625 states. [2022-02-20 19:45:03,557 INFO L87 Difference]: Start difference. First operand has 2623 states, 2621 states have (on average 1.5143075162151851) internal successors, (3969), 2622 states have internal predecessors, (3969), 0 states have call successors, (0), 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 2625 states. [2022-02-20 19:45:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:03,726 INFO L93 Difference]: Finished difference Result 2625 states and 3970 transitions. [2022-02-20 19:45:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3970 transitions. [2022-02-20 19:45:03,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:03,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:03,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:03,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2621 states have (on average 1.5143075162151851) internal successors, (3969), 2622 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 3969 transitions. [2022-02-20 19:45:03,907 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 3969 transitions. Word has length 64 [2022-02-20 19:45:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:03,907 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 3969 transitions. [2022-02-20 19:45:03,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3969 transitions. [2022-02-20 19:45:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:03,907 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:03,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:03,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:45:03,908 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1701027568, now seen corresponding path program 1 times [2022-02-20 19:45:03,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:03,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141317393] [2022-02-20 19:45:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:03,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {49608#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {49608#true} is VALID [2022-02-20 19:45:03,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {49608#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {49608#true} is VALID [2022-02-20 19:45:03,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {49608#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#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~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {49608#true} is VALID [2022-02-20 19:45:03,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {49608#true} assume 0 == ~r1~0; {49608#true} is VALID [2022-02-20 19:45:03,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {49608#true} assume ~id1~0 >= 0; {49608#true} is VALID [2022-02-20 19:45:03,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {49608#true} assume 0 == ~st1~0; {49608#true} is VALID [2022-02-20 19:45:03,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {49608#true} assume ~send1~0 == ~id1~0; {49608#true} is VALID [2022-02-20 19:45:03,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {49608#true} assume 0 == ~mode1~0 % 256; {49608#true} is VALID [2022-02-20 19:45:03,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {49608#true} assume ~id2~0 >= 0; {49608#true} is VALID [2022-02-20 19:45:03,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {49608#true} assume 0 == ~st2~0; {49608#true} is VALID [2022-02-20 19:45:03,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {49608#true} assume ~send2~0 == ~id2~0; {49608#true} is VALID [2022-02-20 19:45:03,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {49608#true} assume 0 == ~mode2~0 % 256; {49608#true} is VALID [2022-02-20 19:45:03,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {49608#true} assume ~id3~0 >= 0; {49608#true} is VALID [2022-02-20 19:45:03,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {49608#true} assume 0 == ~st3~0; {49608#true} is VALID [2022-02-20 19:45:03,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {49608#true} assume ~send3~0 == ~id3~0; {49608#true} is VALID [2022-02-20 19:45:03,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {49608#true} assume 0 == ~mode3~0 % 256; {49608#true} is VALID [2022-02-20 19:45:03,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {49608#true} assume ~id4~0 >= 0; {49608#true} is VALID [2022-02-20 19:45:03,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {49608#true} assume 0 == ~st4~0; {49608#true} is VALID [2022-02-20 19:45:03,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {49608#true} assume ~send4~0 == ~id4~0; {49608#true} is VALID [2022-02-20 19:45:03,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {49608#true} assume 0 == ~mode4~0 % 256; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:03,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {49609#false} is VALID [2022-02-20 19:45:03,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {49609#false} assume !(node4_~m4~0#1 != ~nomsg~0); {49609#false} is VALID [2022-02-20 19:45:03,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {49609#false} ~mode4~0 := 0; {49609#false} is VALID [2022-02-20 19:45:03,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {49609#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {49609#false} is VALID [2022-02-20 19:45:03,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {49609#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {49609#false} is VALID [2022-02-20 19:45:03,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {49609#false} assume !(node5_~m5~0#1 != ~nomsg~0); {49609#false} is VALID [2022-02-20 19:45:03,982 INFO L290 TraceCheckUtils]: 57: Hoare triple {49609#false} ~mode5~0 := 0; {49609#false} is VALID [2022-02-20 19:45:03,982 INFO L290 TraceCheckUtils]: 58: Hoare triple {49609#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {49609#false} is VALID [2022-02-20 19:45:03,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {49609#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {49609#false} is VALID [2022-02-20 19:45:03,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {49609#false} check_#res#1 := check_~tmp~1#1; {49609#false} is VALID [2022-02-20 19:45:03,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {49609#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {49609#false} is VALID [2022-02-20 19:45:03,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {49609#false} assume 0 == assert_~arg#1 % 256; {49609#false} is VALID [2022-02-20 19:45:03,982 INFO L290 TraceCheckUtils]: 63: Hoare triple {49609#false} assume !false; {49609#false} is VALID [2022-02-20 19:45:03,983 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:45:03,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:03,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141317393] [2022-02-20 19:45:03,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141317393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:03,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:03,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:03,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069637279] [2022-02-20 19:45:03,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:03,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:03,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:03,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:04,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:04,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:04,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:04,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:04,026 INFO L87 Difference]: Start difference. First operand 2623 states and 3969 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:05,996 INFO L93 Difference]: Finished difference Result 3235 states and 4923 transitions. [2022-02-20 19:45:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:05,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:06,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:45:07,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:07,563 INFO L225 Difference]: With dead ends: 3235 [2022-02-20 19:45:07,563 INFO L226 Difference]: Without dead ends: 2905 [2022-02-20 19:45:07,565 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:45:07,567 INFO L933 BasicCegarLoop]: 1611 mSDtfsCounter, 1499 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1703 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:45:07,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1703 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2022-02-20 19:45:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2903. [2022-02-20 19:45:07,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:07,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2905 states. Second operand has 2903 states, 2901 states have (on average 1.5156842468114444) internal successors, (4397), 2902 states have internal predecessors, (4397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:07,725 INFO L74 IsIncluded]: Start isIncluded. First operand 2905 states. Second operand has 2903 states, 2901 states have (on average 1.5156842468114444) internal successors, (4397), 2902 states have internal predecessors, (4397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:07,727 INFO L87 Difference]: Start difference. First operand 2905 states. Second operand has 2903 states, 2901 states have (on average 1.5156842468114444) internal successors, (4397), 2902 states have internal predecessors, (4397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:07,922 INFO L93 Difference]: Finished difference Result 2905 states and 4398 transitions. [2022-02-20 19:45:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4398 transitions. [2022-02-20 19:45:07,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:07,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:07,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 2903 states, 2901 states have (on average 1.5156842468114444) internal successors, (4397), 2902 states have internal predecessors, (4397), 0 states have call successors, (0), 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 2905 states. [2022-02-20 19:45:07,929 INFO L87 Difference]: Start difference. First operand has 2903 states, 2901 states have (on average 1.5156842468114444) internal successors, (4397), 2902 states have internal predecessors, (4397), 0 states have call successors, (0), 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 2905 states. [2022-02-20 19:45:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:08,130 INFO L93 Difference]: Finished difference Result 2905 states and 4398 transitions. [2022-02-20 19:45:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4398 transitions. [2022-02-20 19:45:08,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:08,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:08,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:08,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2901 states have (on average 1.5156842468114444) internal successors, (4397), 2902 states have internal predecessors, (4397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4397 transitions. [2022-02-20 19:45:08,361 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4397 transitions. Word has length 64 [2022-02-20 19:45:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:08,362 INFO L470 AbstractCegarLoop]: Abstraction has 2903 states and 4397 transitions. [2022-02-20 19:45:08,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4397 transitions. [2022-02-20 19:45:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:08,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:08,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:08,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:45:08,362 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:08,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1105068988, now seen corresponding path program 1 times [2022-02-20 19:45:08,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:08,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053036853] [2022-02-20 19:45:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:08,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:08,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {61913#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {61913#true} is VALID [2022-02-20 19:45:08,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {61913#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {61913#true} is VALID [2022-02-20 19:45:08,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {61913#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#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~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {61913#true} is VALID [2022-02-20 19:45:08,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {61913#true} assume 0 == ~r1~0; {61913#true} is VALID [2022-02-20 19:45:08,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {61913#true} assume ~id1~0 >= 0; {61913#true} is VALID [2022-02-20 19:45:08,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {61913#true} assume 0 == ~st1~0; {61913#true} is VALID [2022-02-20 19:45:08,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {61913#true} assume ~send1~0 == ~id1~0; {61913#true} is VALID [2022-02-20 19:45:08,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {61913#true} assume 0 == ~mode1~0 % 256; {61913#true} is VALID [2022-02-20 19:45:08,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {61913#true} assume ~id2~0 >= 0; {61913#true} is VALID [2022-02-20 19:45:08,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {61913#true} assume 0 == ~st2~0; {61913#true} is VALID [2022-02-20 19:45:08,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {61913#true} assume ~send2~0 == ~id2~0; {61913#true} is VALID [2022-02-20 19:45:08,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {61913#true} assume 0 == ~mode2~0 % 256; {61913#true} is VALID [2022-02-20 19:45:08,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {61913#true} assume ~id3~0 >= 0; {61913#true} is VALID [2022-02-20 19:45:08,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {61913#true} assume 0 == ~st3~0; {61913#true} is VALID [2022-02-20 19:45:08,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {61913#true} assume ~send3~0 == ~id3~0; {61913#true} is VALID [2022-02-20 19:45:08,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {61913#true} assume 0 == ~mode3~0 % 256; {61913#true} is VALID [2022-02-20 19:45:08,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {61913#true} assume ~id4~0 >= 0; {61913#true} is VALID [2022-02-20 19:45:08,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {61913#true} assume 0 == ~st4~0; {61913#true} is VALID [2022-02-20 19:45:08,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {61913#true} assume ~send4~0 == ~id4~0; {61913#true} is VALID [2022-02-20 19:45:08,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {61913#true} assume 0 == ~mode4~0 % 256; {61913#true} is VALID [2022-02-20 19:45:08,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {61913#true} assume ~id5~0 >= 0; {61913#true} is VALID [2022-02-20 19:45:08,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {61913#true} assume 0 == ~st5~0; {61913#true} is VALID [2022-02-20 19:45:08,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {61913#true} assume ~send5~0 == ~id5~0; {61913#true} is VALID [2022-02-20 19:45:08,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {61913#true} assume 0 == ~mode5~0 % 256; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:08,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {61915#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {61914#false} is VALID [2022-02-20 19:45:08,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {61914#false} assume !(node5_~m5~0#1 != ~nomsg~0); {61914#false} is VALID [2022-02-20 19:45:08,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {61914#false} ~mode5~0 := 0; {61914#false} is VALID [2022-02-20 19:45:08,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {61914#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {61914#false} is VALID [2022-02-20 19:45:08,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {61914#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {61914#false} is VALID [2022-02-20 19:45:08,439 INFO L290 TraceCheckUtils]: 60: Hoare triple {61914#false} check_#res#1 := check_~tmp~1#1; {61914#false} is VALID [2022-02-20 19:45:08,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {61914#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {61914#false} is VALID [2022-02-20 19:45:08,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {61914#false} assume 0 == assert_~arg#1 % 256; {61914#false} is VALID [2022-02-20 19:45:08,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {61914#false} assume !false; {61914#false} is VALID [2022-02-20 19:45:08,440 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:45:08,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:08,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053036853] [2022-02-20 19:45:08,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053036853] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:08,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:08,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:08,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795454299] [2022-02-20 19:45:08,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:08,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:08,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:08,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:08,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:08,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:08,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:08,483 INFO L87 Difference]: Start difference. First operand 2903 states and 4397 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:10,977 INFO L93 Difference]: Finished difference Result 4027 states and 6127 transitions. [2022-02-20 19:45:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:10,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:10,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:45:12,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:12,808 INFO L225 Difference]: With dead ends: 4027 [2022-02-20 19:45:12,808 INFO L226 Difference]: Without dead ends: 3417 [2022-02-20 19:45:12,809 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:45:12,810 INFO L933 BasicCegarLoop]: 1606 mSDtfsCounter, 1495 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1702 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:45:12,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1495 Valid, 1702 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2022-02-20 19:45:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3415. [2022-02-20 19:45:13,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:13,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3417 states. Second operand has 3415 states, 3413 states have (on average 1.5133313800175798) internal successors, (5165), 3414 states have internal predecessors, (5165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:13,087 INFO L74 IsIncluded]: Start isIncluded. First operand 3417 states. Second operand has 3415 states, 3413 states have (on average 1.5133313800175798) internal successors, (5165), 3414 states have internal predecessors, (5165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:13,089 INFO L87 Difference]: Start difference. First operand 3417 states. Second operand has 3415 states, 3413 states have (on average 1.5133313800175798) internal successors, (5165), 3414 states have internal predecessors, (5165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:13,402 INFO L93 Difference]: Finished difference Result 3417 states and 5166 transitions. [2022-02-20 19:45:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5166 transitions. [2022-02-20 19:45:13,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:13,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:13,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 3415 states, 3413 states have (on average 1.5133313800175798) internal successors, (5165), 3414 states have internal predecessors, (5165), 0 states have call successors, (0), 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 3417 states. [2022-02-20 19:45:13,412 INFO L87 Difference]: Start difference. First operand has 3415 states, 3413 states have (on average 1.5133313800175798) internal successors, (5165), 3414 states have internal predecessors, (5165), 0 states have call successors, (0), 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 3417 states. [2022-02-20 19:45:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:13,737 INFO L93 Difference]: Finished difference Result 3417 states and 5166 transitions. [2022-02-20 19:45:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5166 transitions. [2022-02-20 19:45:13,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:13,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:13,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:13,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3413 states have (on average 1.5133313800175798) internal successors, (5165), 3414 states have internal predecessors, (5165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 5165 transitions. [2022-02-20 19:45:14,093 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 5165 transitions. Word has length 64 [2022-02-20 19:45:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:14,093 INFO L470 AbstractCegarLoop]: Abstraction has 3415 states and 5165 transitions. [2022-02-20 19:45:14,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 5165 transitions. [2022-02-20 19:45:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:14,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:14,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:14,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:45:14,094 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:14,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash 112916410, now seen corresponding path program 1 times [2022-02-20 19:45:14,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:14,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855438020] [2022-02-20 19:45:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:14,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {76866#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {76866#true} is VALID [2022-02-20 19:45:14,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {76866#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {76866#true} is VALID [2022-02-20 19:45:14,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {76866#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#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~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {76866#true} is VALID [2022-02-20 19:45:14,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {76866#true} assume 0 == ~r1~0; {76866#true} is VALID [2022-02-20 19:45:14,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {76866#true} assume ~id1~0 >= 0; {76866#true} is VALID [2022-02-20 19:45:14,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {76866#true} assume 0 == ~st1~0; {76868#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:14,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {76868#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {76868#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:14,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {76868#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {76868#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:14,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {76868#(<= ~st1~0 0)} assume ~id2~0 >= 0; {76868#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:14,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {76868#(<= ~st1~0 0)} assume 0 == ~st2~0; {76869#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {76869#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {76869#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {76869#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {76869#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {76869#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {76869#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {76869#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {76870#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {76870#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {76870#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {76870#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {76870#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {76870#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {76870#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {76870#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {76871#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {76871#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {76871#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {76871#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {76871#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {76871#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {76871#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {76871#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 10);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; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {76872#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {76867#false} is VALID [2022-02-20 19:45:14,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {76867#false} check_#res#1 := check_~tmp~1#1; {76867#false} is VALID [2022-02-20 19:45:14,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {76867#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {76867#false} is VALID [2022-02-20 19:45:14,221 INFO L290 TraceCheckUtils]: 62: Hoare triple {76867#false} assume 0 == assert_~arg#1 % 256; {76867#false} is VALID [2022-02-20 19:45:14,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {76867#false} assume !false; {76867#false} is VALID [2022-02-20 19:45:14,225 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:45:14,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:14,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855438020] [2022-02-20 19:45:14,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855438020] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:14,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:14,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:45:14,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971688084] [2022-02-20 19:45:14,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:14,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:14,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:14,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:14,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:45:14,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:45:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:45:14,270 INFO L87 Difference]: Start difference. First operand 3415 states and 5165 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)