./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3556d84b743029397591123c4f713fb54c922b0817fe8965ed5070f16a3f39a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:44:51,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:44:51,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:44:51,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:44:51,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:44:51,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:44:51,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:44:51,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:44:51,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:44:51,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:44:51,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:44:51,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:44:51,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:44:51,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:44:51,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:44:51,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:44:51,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:44:51,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:44:51,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:44:51,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:44:51,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:44:51,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:44:51,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:44:51,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:44:51,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:44:51,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:44:51,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:44:51,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:44:51,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:44:51,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:44:51,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:44:51,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:44:51,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:44:51,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:44:51,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:44:51,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:44:51,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:44:51,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:44:51,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:44:51,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:44:51,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:44:51,553 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:51,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:44:51,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:44:51,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:44:51,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:44:51,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:44:51,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:44:51,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:44:51,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:44:51,581 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:44:51,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:44:51,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:44:51,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:44:51,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:44:51,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:44:51,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:44:51,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:44:51,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:44:51,582 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:44:51,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:44:51,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:44:51,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:44:51,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:44:51,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:44:51,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:44:51,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:51,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:44:51,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:44:51,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:44:51,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:44:51,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:44:51,585 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:44:51,585 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:44:51,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:44:51,585 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 -> c3556d84b743029397591123c4f713fb54c922b0817fe8965ed5070f16a3f39a [2022-02-20 19:44:51,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:44:51,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:44:51,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:44:51,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:44:51,791 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:44:51,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:44:51,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39662de4b/56964e34fd814518a83ebc869735f9e6/FLAGce1166b8d [2022-02-20 19:44:52,401 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:44:52,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:44:52,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39662de4b/56964e34fd814518a83ebc869735f9e6/FLAGce1166b8d [2022-02-20 19:44:52,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39662de4b/56964e34fd814518a83ebc869735f9e6 [2022-02-20 19:44:52,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:44:52,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:44:52,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:52,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:44:52,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:44:52,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:52" (1/1) ... [2022-02-20 19:44:52,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138add0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:52, skipping insertion in model container [2022-02-20 19:44:52,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:52" (1/1) ... [2022-02-20 19:44:52,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:44:52,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:44:53,220 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.UNBOUNDED.pals+Problem12_label01.c[11668,11681] [2022-02-20 19:44:53,252 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.UNBOUNDED.pals+Problem12_label01.c[17223,17236] [2022-02-20 19:44:53,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:53,758 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:44:53,790 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.UNBOUNDED.pals+Problem12_label01.c[11668,11681] [2022-02-20 19:44:53,802 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.UNBOUNDED.pals+Problem12_label01.c[17223,17236] [2022-02-20 19:44:54,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:54,144 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:44:54,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:54 WrapperNode [2022-02-20 19:44:54,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:54,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:54,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:44:54,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:44:54,151 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:54" (1/1) ... [2022-02-20 19:44:54,189 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:54" (1/1) ... [2022-02-20 19:44:54,523 INFO L137 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5088 [2022-02-20 19:44:54,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:54,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:44:54,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:44:54,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:44:54,531 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:54" (1/1) ... [2022-02-20 19:44:54,532 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:54" (1/1) ... [2022-02-20 19:44:54,572 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:54" (1/1) ... [2022-02-20 19:44:54,573 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:54" (1/1) ... [2022-02-20 19:44:54,672 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:54" (1/1) ... [2022-02-20 19:44:54,698 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:54" (1/1) ... [2022-02-20 19:44:54,739 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:54" (1/1) ... [2022-02-20 19:44:54,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:44:54,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:44:54,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:44:54,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:44:54,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:54" (1/1) ... [2022-02-20 19:44:54,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:54,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:44:54,842 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:54,844 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:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:44:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:44:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:44:54,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:44:54,974 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:44:54,975 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:45:01,163 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:45:01,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:45:01,180 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:45:01,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:01 BoogieIcfgContainer [2022-02-20 19:45:01,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:45:01,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:45:01,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:45:01,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:45:01,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:44:52" (1/3) ... [2022-02-20 19:45:01,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b6e83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:01, skipping insertion in model container [2022-02-20 19:45:01,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:54" (2/3) ... [2022-02-20 19:45:01,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b6e83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:01, skipping insertion in model container [2022-02-20 19:45:01,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:01" (3/3) ... [2022-02-20 19:45:01,189 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:45:01,192 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:45:01,192 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:45:01,238 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:45:01,244 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:45:01,244 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:45:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 911 states, 908 states have (on average 1.8997797356828194) internal successors, (1725), 910 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call 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,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:45:01,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:01,293 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:45:01,294 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1083425478, now seen corresponding path program 1 times [2022-02-20 19:45:01,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:01,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800790296] [2022-02-20 19:45:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:01,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:01,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {914#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {914#true} is VALID [2022-02-20 19:45:01,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {914#true} is VALID [2022-02-20 19:45:01,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~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; {914#true} is VALID [2022-02-20 19:45:01,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {914#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {914#true} is VALID [2022-02-20 19:45:01,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {914#true} init_#res#1 := init_~tmp~0#1; {914#true} is VALID [2022-02-20 19:45:01,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#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; {914#true} is VALID [2022-02-20 19:45:01,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {914#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {915#false} is VALID [2022-02-20 19:45:01,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#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; {915#false} is VALID [2022-02-20 19:45:01,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {915#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {915#false} is VALID [2022-02-20 19:45:01,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {915#false} assume !(0 != ~mode1~0 % 256); {915#false} is VALID [2022-02-20 19:45:01,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {915#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {915#false} is VALID [2022-02-20 19:45:01,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {915#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {915#false} is VALID [2022-02-20 19:45:01,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {915#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; {915#false} is VALID [2022-02-20 19:45:01,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {915#false} assume !(0 != ~mode2~0 % 256); {915#false} is VALID [2022-02-20 19:45:01,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {915#false} is VALID [2022-02-20 19:45:01,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {915#false} is VALID [2022-02-20 19:45:01,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {915#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; {915#false} is VALID [2022-02-20 19:45:01,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {915#false} assume !(0 != ~mode3~0 % 256); {915#false} is VALID [2022-02-20 19:45:01,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {915#false} is VALID [2022-02-20 19:45:01,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {915#false} is VALID [2022-02-20 19:45:01,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#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; {915#false} is VALID [2022-02-20 19:45:01,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {915#false} assume !(0 != ~mode4~0 % 256); {915#false} is VALID [2022-02-20 19:45:01,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {915#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {915#false} is VALID [2022-02-20 19:45:01,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {915#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {915#false} is VALID [2022-02-20 19:45:01,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {915#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; {915#false} is VALID [2022-02-20 19:45:01,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {915#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {915#false} is VALID [2022-02-20 19:45:01,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {915#false} assume !(node5_~m5~0#1 != ~nomsg~0); {915#false} is VALID [2022-02-20 19:45:01,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {915#false} ~mode5~0 := 0; {915#false} is VALID [2022-02-20 19:45:01,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {915#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; {915#false} is VALID [2022-02-20 19:45:01,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {915#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {915#false} is VALID [2022-02-20 19:45:01,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {915#false} check_#res#1 := check_~tmp~1#1; {915#false} is VALID [2022-02-20 19:45:01,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {915#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; {915#false} is VALID [2022-02-20 19:45:01,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {915#false} assume 0 == assert_~arg#1 % 256; {915#false} is VALID [2022-02-20 19:45:01,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-02-20 19:45:01,467 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:01,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:01,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800790296] [2022-02-20 19:45:01,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800790296] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:01,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:01,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:45:01,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474807356] [2022-02-20 19:45:01,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:01,475 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:45:01,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:01,478 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:45:01,508 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:45:01,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:45:01,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:45:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:45:01,533 INFO L87 Difference]: Start difference. First operand has 911 states, 908 states have (on average 1.8997797356828194) internal successors, (1725), 910 states have internal predecessors, (1725), 0 states have call successors, (0), 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:45:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:02,702 INFO L93 Difference]: Finished difference Result 1783 states and 3378 transitions. [2022-02-20 19:45:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:45:02,702 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:45:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:02,703 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:45:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3378 transitions. [2022-02-20 19:45:02,732 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:45:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3378 transitions. [2022-02-20 19:45:02,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3378 transitions. [2022-02-20 19:45:05,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3378 edges. 3378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:05,255 INFO L225 Difference]: With dead ends: 1783 [2022-02-20 19:45:05,255 INFO L226 Difference]: Without dead ends: 845 [2022-02-20 19:45:05,262 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:45:05,265 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:45:05,266 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:45:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-02-20 19:45:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2022-02-20 19:45:05,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:05,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call 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,341 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call 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,343 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call 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,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:05,368 INFO L93 Difference]: Finished difference Result 845 states and 1592 transitions. [2022-02-20 19:45:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1592 transitions. [2022-02-20 19:45:05,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:05,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:05,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 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 845 states. [2022-02-20 19:45:05,375 INFO L87 Difference]: Start difference. First operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 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 845 states. [2022-02-20 19:45:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:05,400 INFO L93 Difference]: Finished difference Result 845 states and 1592 transitions. [2022-02-20 19:45:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1592 transitions. [2022-02-20 19:45:05,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:05,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:05,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:05,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.8884934756820877) internal successors, (1592), 844 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call 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,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1592 transitions. [2022-02-20 19:45:05,429 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1592 transitions. Word has length 34 [2022-02-20 19:45:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:05,429 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1592 transitions. [2022-02-20 19:45:05,429 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:45:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1592 transitions. [2022-02-20 19:45:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:45:05,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:05,430 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:45:05,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:45:05,431 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1592898568, now seen corresponding path program 1 times [2022-02-20 19:45:05,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:05,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207540766] [2022-02-20 19:45:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:05,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {5280#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {5280#true} is VALID [2022-02-20 19:45:05,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {5280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {5280#true} is VALID [2022-02-20 19:45:05,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {5280#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~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; {5280#true} is VALID [2022-02-20 19:45:05,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {5280#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5282#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:45:05,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {5282#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5283#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:45:05,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {5283#(= |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; {5284#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:45:05,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {5284#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5281#false} is VALID [2022-02-20 19:45:05,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {5281#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; {5281#false} is VALID [2022-02-20 19:45:05,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {5281#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5281#false} is VALID [2022-02-20 19:45:05,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {5281#false} assume !(0 != ~mode1~0 % 256); {5281#false} is VALID [2022-02-20 19:45:05,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {5281#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5281#false} is VALID [2022-02-20 19:45:05,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {5281#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {5281#false} is VALID [2022-02-20 19:45:05,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {5281#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; {5281#false} is VALID [2022-02-20 19:45:05,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {5281#false} assume !(0 != ~mode2~0 % 256); {5281#false} is VALID [2022-02-20 19:45:05,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {5281#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5281#false} is VALID [2022-02-20 19:45:05,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {5281#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {5281#false} is VALID [2022-02-20 19:45:05,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {5281#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; {5281#false} is VALID [2022-02-20 19:45:05,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {5281#false} assume !(0 != ~mode3~0 % 256); {5281#false} is VALID [2022-02-20 19:45:05,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {5281#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5281#false} is VALID [2022-02-20 19:45:05,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {5281#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {5281#false} is VALID [2022-02-20 19:45:05,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {5281#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; {5281#false} is VALID [2022-02-20 19:45:05,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {5281#false} assume !(0 != ~mode4~0 % 256); {5281#false} is VALID [2022-02-20 19:45:05,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {5281#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {5281#false} is VALID [2022-02-20 19:45:05,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {5281#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {5281#false} is VALID [2022-02-20 19:45:05,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {5281#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; {5281#false} is VALID [2022-02-20 19:45:05,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {5281#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5281#false} is VALID [2022-02-20 19:45:05,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {5281#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5281#false} is VALID [2022-02-20 19:45:05,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {5281#false} ~mode5~0 := 0; {5281#false} is VALID [2022-02-20 19:45:05,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {5281#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; {5281#false} is VALID [2022-02-20 19:45:05,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {5281#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5281#false} is VALID [2022-02-20 19:45:05,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {5281#false} check_#res#1 := check_~tmp~1#1; {5281#false} is VALID [2022-02-20 19:45:05,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {5281#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; {5281#false} is VALID [2022-02-20 19:45:05,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {5281#false} assume 0 == assert_~arg#1 % 256; {5281#false} is VALID [2022-02-20 19:45:05,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {5281#false} assume !false; {5281#false} is VALID [2022-02-20 19:45:05,509 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:05,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:05,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207540766] [2022-02-20 19:45:05,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207540766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:05,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:05,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:45:05,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176097585] [2022-02-20 19:45:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:05,513 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:45:05,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:05,514 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:45:05,532 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:45:05,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:45:05,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:05,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:45:05,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:45:05,534 INFO L87 Difference]: Start difference. First operand 845 states and 1592 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:45:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:09,254 INFO L93 Difference]: Finished difference Result 903 states and 1681 transitions. [2022-02-20 19:45:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:45:09,255 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:45:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:09,255 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:45:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1681 transitions. [2022-02-20 19:45:09,262 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:45:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1681 transitions. [2022-02-20 19:45:09,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1681 transitions. [2022-02-20 19:45:10,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1681 edges. 1681 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:10,448 INFO L225 Difference]: With dead ends: 903 [2022-02-20 19:45:10,448 INFO L226 Difference]: Without dead ends: 845 [2022-02-20 19:45:10,451 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:45:10,453 INFO L933 BasicCegarLoop]: 1590 mSDtfsCounter, 3 mSDsluCounter, 4736 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6326 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:45:10,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6326 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-02-20 19:45:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2022-02-20 19:45:10,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:10,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call 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,474 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call 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,476 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call 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,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:10,498 INFO L93 Difference]: Finished difference Result 845 states and 1561 transitions. [2022-02-20 19:45:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1561 transitions. [2022-02-20 19:45:10,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:10,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:10,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 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 845 states. [2022-02-20 19:45:10,502 INFO L87 Difference]: Start difference. First operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 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 845 states. [2022-02-20 19:45:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:10,527 INFO L93 Difference]: Finished difference Result 845 states and 1561 transitions. [2022-02-20 19:45:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1561 transitions. [2022-02-20 19:45:10,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:10,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:10,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:10,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.8517200474495847) internal successors, (1561), 844 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call 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,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1561 transitions. [2022-02-20 19:45:10,554 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1561 transitions. Word has length 34 [2022-02-20 19:45:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:10,554 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1561 transitions. [2022-02-20 19:45:10,554 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:45:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1561 transitions. [2022-02-20 19:45:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 19:45:10,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:10,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:10,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:45:10,557 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1279579051, now seen corresponding path program 1 times [2022-02-20 19:45:10,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:10,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398158136] [2022-02-20 19:45:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:10,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {8766#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet47#1);havoc main_#t~nondet47#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet45#1, main2_#t~ret46#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet45#1 && main2_#t~nondet45#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet45#1;havoc main2_#t~nondet45#1; {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 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~ret42#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:45:10,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {8768#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8769#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:45:10,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {8769#(not (= (+ (- 3) ~a5~0) 0))} assume (((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {8767#false} is VALID [2022-02-20 19:45:10,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {8767#false} assume !false; {8767#false} is VALID [2022-02-20 19:45:10,773 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:10,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:10,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398158136] [2022-02-20 19:45:10,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398158136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:10,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:10,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:10,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793141724] [2022-02-20 19:45:10,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:10,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 19:45:10,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:10,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:10,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:45:10,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:45:10,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:45:10,815 INFO L87 Difference]: Start difference. First operand 845 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:22,118 INFO L93 Difference]: Finished difference Result 3100 states and 5870 transitions. [2022-02-20 19:45:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:45:22,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 19:45:22,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5870 transitions. [2022-02-20 19:45:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5870 transitions. [2022-02-20 19:45:22,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5870 transitions. [2022-02-20 19:45:26,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5870 edges. 5870 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:26,554 INFO L225 Difference]: With dead ends: 3100 [2022-02-20 19:45:26,554 INFO L226 Difference]: Without dead ends: 2347 [2022-02-20 19:45:26,555 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:45:26,555 INFO L933 BasicCegarLoop]: 797 mSDtfsCounter, 2453 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:26,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2453 Valid, 815 Invalid, 6515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-02-20 19:45:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2022-02-20 19:45:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2347. [2022-02-20 19:45:26,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:26,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2347 states. Second operand has 2347 states, 2345 states have (on average 1.5671641791044777) internal successors, (3675), 2346 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call 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:26,601 INFO L74 IsIncluded]: Start isIncluded. First operand 2347 states. Second operand has 2347 states, 2345 states have (on average 1.5671641791044777) internal successors, (3675), 2346 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call 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:26,604 INFO L87 Difference]: Start difference. First operand 2347 states. Second operand has 2347 states, 2345 states have (on average 1.5671641791044777) internal successors, (3675), 2346 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call 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:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:26,747 INFO L93 Difference]: Finished difference Result 2347 states and 3675 transitions. [2022-02-20 19:45:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3675 transitions. [2022-02-20 19:45:26,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:26,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:26,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 2347 states, 2345 states have (on average 1.5671641791044777) internal successors, (3675), 2346 states have internal predecessors, (3675), 0 states have call successors, (0), 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 2347 states. [2022-02-20 19:45:26,756 INFO L87 Difference]: Start difference. First operand has 2347 states, 2345 states have (on average 1.5671641791044777) internal successors, (3675), 2346 states have internal predecessors, (3675), 0 states have call successors, (0), 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 2347 states. [2022-02-20 19:45:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:26,923 INFO L93 Difference]: Finished difference Result 2347 states and 3675 transitions. [2022-02-20 19:45:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3675 transitions. [2022-02-20 19:45:26,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:26,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:26,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:26,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 2345 states have (on average 1.5671641791044777) internal successors, (3675), 2346 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call 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:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3675 transitions. [2022-02-20 19:45:27,077 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3675 transitions. Word has length 48 [2022-02-20 19:45:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:27,079 INFO L470 AbstractCegarLoop]: Abstraction has 2347 states and 3675 transitions. [2022-02-20 19:45:27,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3675 transitions. [2022-02-20 19:45:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:27,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:27,080 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:27,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:45:27,081 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:27,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1337087153, now seen corresponding path program 1 times [2022-02-20 19:45:27,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:27,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740180666] [2022-02-20 19:45:27,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:27,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {18968#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {18968#true} is VALID [2022-02-20 19:45:27,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {18968#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {18968#true} is VALID [2022-02-20 19:45:27,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {18968#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~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; {18968#true} is VALID [2022-02-20 19:45:27,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {18968#true} assume 0 == ~r1~0 % 256; {18968#true} is VALID [2022-02-20 19:45:27,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {18968#true} assume ~id1~0 >= 0; {18968#true} is VALID [2022-02-20 19:45:27,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {18968#true} assume 0 == ~st1~0; {18968#true} is VALID [2022-02-20 19:45:27,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {18968#true} assume ~send1~0 == ~id1~0; {18968#true} is VALID [2022-02-20 19:45:27,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {18968#true} assume 0 == ~mode1~0 % 256; {18968#true} is VALID [2022-02-20 19:45:27,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {18968#true} assume ~id2~0 >= 0; {18968#true} is VALID [2022-02-20 19:45:27,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {18968#true} assume 0 == ~st2~0; {18968#true} is VALID [2022-02-20 19:45:27,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {18968#true} assume ~send2~0 == ~id2~0; {18968#true} is VALID [2022-02-20 19:45:27,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {18968#true} assume 0 == ~mode2~0 % 256; {18968#true} is VALID [2022-02-20 19:45:27,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {18968#true} assume ~id3~0 >= 0; {18968#true} is VALID [2022-02-20 19:45:27,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {18968#true} assume 0 == ~st3~0; {18968#true} is VALID [2022-02-20 19:45:27,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {18968#true} assume ~send3~0 == ~id3~0; {18968#true} is VALID [2022-02-20 19:45:27,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {18968#true} assume 0 == ~mode3~0 % 256; {18968#true} is VALID [2022-02-20 19:45:27,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {18968#true} assume ~id4~0 >= 0; {18968#true} is VALID [2022-02-20 19:45:27,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {18968#true} assume 0 == ~st4~0; {18968#true} is VALID [2022-02-20 19:45:27,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {18968#true} assume ~send4~0 == ~id4~0; {18968#true} is VALID [2022-02-20 19:45:27,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {18968#true} assume 0 == ~mode4~0 % 256; {18968#true} is VALID [2022-02-20 19:45:27,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {18968#true} assume ~id5~0 >= 0; {18968#true} is VALID [2022-02-20 19:45:27,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {18968#true} assume 0 == ~st5~0; {18968#true} is VALID [2022-02-20 19:45:27,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {18968#true} assume ~send5~0 == ~id5~0; {18968#true} is VALID [2022-02-20 19:45:27,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {18968#true} assume 0 == ~mode5~0 % 256; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {18970#(= (+ (* (- 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; {18970#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:27,169 INFO L290 TraceCheckUtils]: 55: Hoare triple {18970#(= (+ (* (- 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; {18969#false} is VALID [2022-02-20 19:45:27,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {18969#false} assume !(node5_~m5~0#1 != ~nomsg~0); {18969#false} is VALID [2022-02-20 19:45:27,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {18969#false} ~mode5~0 := 0; {18969#false} is VALID [2022-02-20 19:45:27,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {18969#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; {18969#false} is VALID [2022-02-20 19:45:27,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {18969#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {18969#false} is VALID [2022-02-20 19:45:27,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {18969#false} check_#res#1 := check_~tmp~1#1; {18969#false} is VALID [2022-02-20 19:45:27,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {18969#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; {18969#false} is VALID [2022-02-20 19:45:27,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {18969#false} assume 0 == assert_~arg#1 % 256; {18969#false} is VALID [2022-02-20 19:45:27,170 INFO L290 TraceCheckUtils]: 63: Hoare triple {18969#false} assume !false; {18969#false} is VALID [2022-02-20 19:45:27,171 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:27,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:27,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740180666] [2022-02-20 19:45:27,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740180666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:27,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:27,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:27,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56380191] [2022-02-20 19:45:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:27,175 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:27,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:27,175 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:27,210 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:27,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:27,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:27,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:27,212 INFO L87 Difference]: Start difference. First operand 2347 states and 3675 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:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:28,913 INFO L93 Difference]: Finished difference Result 2449 states and 3835 transitions. [2022-02-20 19:45:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:28,914 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:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:28,914 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:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:28,921 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:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:28,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions. [2022-02-20 19:45:30,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:30,411 INFO L225 Difference]: With dead ends: 2449 [2022-02-20 19:45:30,411 INFO L226 Difference]: Without dead ends: 2395 [2022-02-20 19:45:30,412 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:30,413 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1498 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1676 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:30,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1676 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:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2022-02-20 19:45:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2393. [2022-02-20 19:45:30,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:30,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2395 states. Second operand has 2393 states, 2391 states have (on average 1.5675449602676705) internal successors, (3748), 2392 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call 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:30,477 INFO L74 IsIncluded]: Start isIncluded. First operand 2395 states. Second operand has 2393 states, 2391 states have (on average 1.5675449602676705) internal successors, (3748), 2392 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call 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:30,480 INFO L87 Difference]: Start difference. First operand 2395 states. Second operand has 2393 states, 2391 states have (on average 1.5675449602676705) internal successors, (3748), 2392 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call 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:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:30,620 INFO L93 Difference]: Finished difference Result 2395 states and 3749 transitions. [2022-02-20 19:45:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3749 transitions. [2022-02-20 19:45:30,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:30,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:30,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 2393 states, 2391 states have (on average 1.5675449602676705) internal successors, (3748), 2392 states have internal predecessors, (3748), 0 states have call successors, (0), 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 2395 states. [2022-02-20 19:45:30,630 INFO L87 Difference]: Start difference. First operand has 2393 states, 2391 states have (on average 1.5675449602676705) internal successors, (3748), 2392 states have internal predecessors, (3748), 0 states have call successors, (0), 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 2395 states. [2022-02-20 19:45:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:30,772 INFO L93 Difference]: Finished difference Result 2395 states and 3749 transitions. [2022-02-20 19:45:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3749 transitions. [2022-02-20 19:45:30,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:30,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:30,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:30,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2391 states have (on average 1.5675449602676705) internal successors, (3748), 2392 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call 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:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3748 transitions. [2022-02-20 19:45:30,931 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3748 transitions. Word has length 64 [2022-02-20 19:45:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:30,931 INFO L470 AbstractCegarLoop]: Abstraction has 2393 states and 3748 transitions. [2022-02-20 19:45:30,931 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:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3748 transitions. [2022-02-20 19:45:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:30,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:30,932 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:30,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:45:30,932 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash -119101755, now seen corresponding path program 1 times [2022-02-20 19:45:30,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:30,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988306119] [2022-02-20 19:45:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:30,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:31,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {28677#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {28677#true} is VALID [2022-02-20 19:45:31,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {28677#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {28677#true} is VALID [2022-02-20 19:45:31,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {28677#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~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; {28677#true} is VALID [2022-02-20 19:45:31,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {28677#true} assume 0 == ~r1~0 % 256; {28677#true} is VALID [2022-02-20 19:45:31,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {28677#true} assume ~id1~0 >= 0; {28677#true} is VALID [2022-02-20 19:45:31,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {28677#true} assume 0 == ~st1~0; {28679#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:31,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {28679#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {28679#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:31,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {28679#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {28679#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:31,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {28679#(<= ~st1~0 0)} assume ~id2~0 >= 0; {28679#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:31,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {28679#(<= ~st1~0 0)} assume 0 == ~st2~0; {28680#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {28680#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {28680#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {28680#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {28680#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {28680#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {28680#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {28680#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {28681#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {28681#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {28681#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {28681#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {28681#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {28681#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {28681#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {28681#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {28682#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {28682#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {28682#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {28682#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {28682#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {28682#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {28682#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {28682#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {28683#(<= (+ ~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 := ~send3~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,022 INFO L290 TraceCheckUtils]: 50: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {28683#(<= (+ ~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 := ~send4~0; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,024 INFO L290 TraceCheckUtils]: 55: Hoare triple {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {28683#(<= (+ ~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; {28683#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:31,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {28683#(<= (+ ~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; {28678#false} is VALID [2022-02-20 19:45:31,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {28678#false} check_#res#1 := check_~tmp~1#1; {28678#false} is VALID [2022-02-20 19:45:31,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {28678#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; {28678#false} is VALID [2022-02-20 19:45:31,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {28678#false} assume 0 == assert_~arg#1 % 256; {28678#false} is VALID [2022-02-20 19:45:31,026 INFO L290 TraceCheckUtils]: 63: Hoare triple {28678#false} assume !false; {28678#false} is VALID [2022-02-20 19:45:31,027 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:31,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:31,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988306119] [2022-02-20 19:45:31,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988306119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:31,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:31,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:45:31,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477986957] [2022-02-20 19:45:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:31,028 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:31,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:31,028 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:31,064 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:31,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:45:31,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:31,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:45:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:45:31,065 INFO L87 Difference]: Start difference. First operand 2393 states and 3748 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) [2022-02-20 19:45:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:35,350 INFO L93 Difference]: Finished difference Result 3393 states and 5328 transitions. [2022-02-20 19:45:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:45:35,350 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:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:45:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2411 transitions. [2022-02-20 19:45:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:45:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2411 transitions. [2022-02-20 19:45:35,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 2411 transitions. [2022-02-20 19:45:37,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2411 edges. 2411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:37,460 INFO L225 Difference]: With dead ends: 3393 [2022-02-20 19:45:37,460 INFO L226 Difference]: Without dead ends: 3293 [2022-02-20 19:45:37,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:45:37,462 INFO L933 BasicCegarLoop]: 1555 mSDtfsCounter, 8419 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8419 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:37,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8419 Valid, 2463 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:45:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2022-02-20 19:45:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 2491. [2022-02-20 19:45:37,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:37,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3293 states. Second operand has 2491 states, 2489 states have (on average 1.5672961028525512) internal successors, (3901), 2490 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call 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:37,613 INFO L74 IsIncluded]: Start isIncluded. First operand 3293 states. Second operand has 2491 states, 2489 states have (on average 1.5672961028525512) internal successors, (3901), 2490 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call 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:37,615 INFO L87 Difference]: Start difference. First operand 3293 states. Second operand has 2491 states, 2489 states have (on average 1.5672961028525512) internal successors, (3901), 2490 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call 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:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:37,899 INFO L93 Difference]: Finished difference Result 3293 states and 5150 transitions. [2022-02-20 19:45:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 5150 transitions. [2022-02-20 19:45:37,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:37,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:37,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 2491 states, 2489 states have (on average 1.5672961028525512) internal successors, (3901), 2490 states have internal predecessors, (3901), 0 states have call successors, (0), 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 3293 states. [2022-02-20 19:45:37,909 INFO L87 Difference]: Start difference. First operand has 2491 states, 2489 states have (on average 1.5672961028525512) internal successors, (3901), 2490 states have internal predecessors, (3901), 0 states have call successors, (0), 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 3293 states. [2022-02-20 19:45:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:38,195 INFO L93 Difference]: Finished difference Result 3293 states and 5150 transitions. [2022-02-20 19:45:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 5150 transitions. [2022-02-20 19:45:38,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:38,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:38,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:38,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2491 states, 2489 states have (on average 1.5672961028525512) internal successors, (3901), 2490 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call 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:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 3901 transitions. [2022-02-20 19:45:38,407 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 3901 transitions. Word has length 64 [2022-02-20 19:45:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:38,407 INFO L470 AbstractCegarLoop]: Abstraction has 2491 states and 3901 transitions. [2022-02-20 19:45:38,407 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 19:45:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3901 transitions. [2022-02-20 19:45:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:45:38,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:38,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:38,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:45:38,408 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:38,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 91634997, now seen corresponding path program 1 times [2022-02-20 19:45:38,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:38,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742820777] [2022-02-20 19:45:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:38,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {41411#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {41411#true} is VALID [2022-02-20 19:45:38,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {41411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {41411#true} is VALID [2022-02-20 19:45:38,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {41411#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~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; {41411#true} is VALID [2022-02-20 19:45:38,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {41411#true} assume 0 == ~r1~0 % 256; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:38,486 INFO L290 TraceCheckUtils]: 60: Hoare triple {41413#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 5; {41412#false} is VALID [2022-02-20 19:45:38,486 INFO L290 TraceCheckUtils]: 61: Hoare triple {41412#false} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {41412#false} is VALID [2022-02-20 19:45:38,486 INFO L290 TraceCheckUtils]: 62: Hoare triple {41412#false} check_#res#1 := check_~tmp~1#1; {41412#false} is VALID [2022-02-20 19:45:38,486 INFO L290 TraceCheckUtils]: 63: Hoare triple {41412#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; {41412#false} is VALID [2022-02-20 19:45:38,486 INFO L290 TraceCheckUtils]: 64: Hoare triple {41412#false} assume 0 == assert_~arg#1 % 256; {41412#false} is VALID [2022-02-20 19:45:38,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {41412#false} assume !false; {41412#false} is VALID [2022-02-20 19:45:38,486 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:38,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:38,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742820777] [2022-02-20 19:45:38,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742820777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:38,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:38,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:38,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697493523] [2022-02-20 19:45:38,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 19:45:38,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:38,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:38,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:38,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:38,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:38,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:38,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:38,529 INFO L87 Difference]: Start difference. First operand 2491 states and 3901 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:40,297 INFO L93 Difference]: Finished difference Result 2865 states and 4485 transitions. [2022-02-20 19:45:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 19:45:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1722 transitions. [2022-02-20 19:45:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1722 transitions. [2022-02-20 19:45:40,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1722 transitions. [2022-02-20 19:45:41,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1722 edges. 1722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:41,796 INFO L225 Difference]: With dead ends: 2865 [2022-02-20 19:45:41,796 INFO L226 Difference]: Without dead ends: 2667 [2022-02-20 19:45:41,798 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:41,798 INFO L933 BasicCegarLoop]: 1557 mSDtfsCounter, 1489 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:41,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1489 Valid, 1635 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-02-20 19:45:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2661. [2022-02-20 19:45:42,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:42,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2667 states. Second operand has 2661 states, 2659 states have (on average 1.564121850319669) internal successors, (4159), 2660 states have internal predecessors, (4159), 0 states have call successors, (0), 0 states have call 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:42,076 INFO L74 IsIncluded]: Start isIncluded. First operand 2667 states. Second operand has 2661 states, 2659 states have (on average 1.564121850319669) internal successors, (4159), 2660 states have internal predecessors, (4159), 0 states have call successors, (0), 0 states have call 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:42,078 INFO L87 Difference]: Start difference. First operand 2667 states. Second operand has 2661 states, 2659 states have (on average 1.564121850319669) internal successors, (4159), 2660 states have internal predecessors, (4159), 0 states have call successors, (0), 0 states have call 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:42,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:42,247 INFO L93 Difference]: Finished difference Result 2667 states and 4164 transitions. [2022-02-20 19:45:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4164 transitions. [2022-02-20 19:45:42,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:42,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:42,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 2661 states, 2659 states have (on average 1.564121850319669) internal successors, (4159), 2660 states have internal predecessors, (4159), 0 states have call successors, (0), 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 2667 states. [2022-02-20 19:45:42,254 INFO L87 Difference]: Start difference. First operand has 2661 states, 2659 states have (on average 1.564121850319669) internal successors, (4159), 2660 states have internal predecessors, (4159), 0 states have call successors, (0), 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 2667 states. [2022-02-20 19:45:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:42,424 INFO L93 Difference]: Finished difference Result 2667 states and 4164 transitions. [2022-02-20 19:45:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4164 transitions. [2022-02-20 19:45:42,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:42,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:42,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:42,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2659 states have (on average 1.564121850319669) internal successors, (4159), 2660 states have internal predecessors, (4159), 0 states have call successors, (0), 0 states have call 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:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4159 transitions. [2022-02-20 19:45:42,609 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4159 transitions. Word has length 66 [2022-02-20 19:45:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:42,609 INFO L470 AbstractCegarLoop]: Abstraction has 2661 states and 4159 transitions. [2022-02-20 19:45:42,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4159 transitions. [2022-02-20 19:45:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:45:42,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:42,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:42,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:45:42,610 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash 158128509, now seen corresponding path program 1 times [2022-02-20 19:45:42,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:42,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785870001] [2022-02-20 19:45:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:42,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:42,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {52464#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {52464#true} is VALID [2022-02-20 19:45:42,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {52464#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {52464#true} is VALID [2022-02-20 19:45:42,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {52464#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~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; {52464#true} is VALID [2022-02-20 19:45:42,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {52464#true} assume 0 == ~r1~0 % 256; {52464#true} is VALID [2022-02-20 19:45:42,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {52464#true} assume ~id1~0 >= 0; {52464#true} is VALID [2022-02-20 19:45:42,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {52464#true} assume 0 == ~st1~0; {52466#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 19:45:42,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {52466#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {52466#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 19:45:42,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {52466#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {52466#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 19:45:42,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {52466#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {52466#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 19:45:42,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {52466#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {52467#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:45:42,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {52467#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {52467#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:45:42,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {52467#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {52467#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:45:42,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {52467#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {52467#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:45:42,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {52467#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {52468#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:45:42,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {52468#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {52468#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:45:42,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {52468#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {52468#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:45:42,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {52468#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {52468#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:45:42,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {52468#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {52469#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:45:42,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {52469#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {52469#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:45:42,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {52469#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {52469#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:45:42,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {52469#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {52469#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:45:42,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {52469#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,834 INFO L290 TraceCheckUtils]: 46: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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 := ~send3~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode4~0 % 256); {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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 := ~send4~0; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode5~0 % 256); {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,843 INFO L290 TraceCheckUtils]: 56: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,843 INFO L290 TraceCheckUtils]: 57: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,844 INFO L290 TraceCheckUtils]: 59: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:45:42,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {52470#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);check_~tmp~1#1 := 0; {52465#false} is VALID [2022-02-20 19:45:42,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {52465#false} check_#res#1 := check_~tmp~1#1; {52465#false} is VALID [2022-02-20 19:45:42,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {52465#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; {52465#false} is VALID [2022-02-20 19:45:42,845 INFO L290 TraceCheckUtils]: 64: Hoare triple {52465#false} assume 0 == assert_~arg#1 % 256; {52465#false} is VALID [2022-02-20 19:45:42,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {52465#false} assume !false; {52465#false} is VALID [2022-02-20 19:45:42,846 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:42,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:42,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785870001] [2022-02-20 19:45:42,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785870001] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:42,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:42,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:45:42,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276795884] [2022-02-20 19:45:42,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:42,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 19:45:42,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:42,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:42,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:42,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:45:42,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:42,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:45:42,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:45:42,897 INFO L87 Difference]: Start difference. First operand 2661 states and 4159 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:47,124 INFO L93 Difference]: Finished difference Result 3031 states and 4729 transitions. [2022-02-20 19:45:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:45:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 19:45:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1729 transitions. [2022-02-20 19:45:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1729 transitions. [2022-02-20 19:45:47,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1729 transitions. [2022-02-20 19:45:48,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1729 edges. 1729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:48,670 INFO L225 Difference]: With dead ends: 3031 [2022-02-20 19:45:48,670 INFO L226 Difference]: Without dead ends: 2663 [2022-02-20 19:45:48,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:45:48,671 INFO L933 BasicCegarLoop]: 1568 mSDtfsCounter, 6156 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6156 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:48,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6156 Valid, 1893 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2022-02-20 19:45:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2022-02-20 19:45:48,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:48,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2663 states. Second operand has 2661 states, 2659 states have (on average 1.5626175253854833) internal successors, (4155), 2660 states have internal predecessors, (4155), 0 states have call successors, (0), 0 states have call 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:48,934 INFO L74 IsIncluded]: Start isIncluded. First operand 2663 states. Second operand has 2661 states, 2659 states have (on average 1.5626175253854833) internal successors, (4155), 2660 states have internal predecessors, (4155), 0 states have call successors, (0), 0 states have call 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:48,935 INFO L87 Difference]: Start difference. First operand 2663 states. Second operand has 2661 states, 2659 states have (on average 1.5626175253854833) internal successors, (4155), 2660 states have internal predecessors, (4155), 0 states have call successors, (0), 0 states have call 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:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:49,101 INFO L93 Difference]: Finished difference Result 2663 states and 4156 transitions. [2022-02-20 19:45:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 4156 transitions. [2022-02-20 19:45:49,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:49,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:49,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 2661 states, 2659 states have (on average 1.5626175253854833) internal successors, (4155), 2660 states have internal predecessors, (4155), 0 states have call successors, (0), 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 2663 states. [2022-02-20 19:45:49,107 INFO L87 Difference]: Start difference. First operand has 2661 states, 2659 states have (on average 1.5626175253854833) internal successors, (4155), 2660 states have internal predecessors, (4155), 0 states have call successors, (0), 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 2663 states. [2022-02-20 19:45:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:49,274 INFO L93 Difference]: Finished difference Result 2663 states and 4156 transitions. [2022-02-20 19:45:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 4156 transitions. [2022-02-20 19:45:49,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:49,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:49,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:49,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2659 states have (on average 1.5626175253854833) internal successors, (4155), 2660 states have internal predecessors, (4155), 0 states have call successors, (0), 0 states have call 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:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4155 transitions. [2022-02-20 19:45:49,462 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4155 transitions. Word has length 66 [2022-02-20 19:45:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:49,462 INFO L470 AbstractCegarLoop]: Abstraction has 2661 states and 4155 transitions. [2022-02-20 19:45:49,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4155 transitions. [2022-02-20 19:45:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:45:49,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:49,463 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:49,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:45:49,463 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1100417095, now seen corresponding path program 1 times [2022-02-20 19:45:49,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:49,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871385531] [2022-02-20 19:45:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:49,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {63715#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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; {63715#true} is VALID [2022-02-20 19:45:49,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {63715#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {63715#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~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; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {63715#true} assume 0 == ~r1~0 % 256; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {63715#true} assume ~id1~0 >= 0; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {63715#true} assume 0 == ~st1~0; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {63715#true} assume ~send1~0 == ~id1~0; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {63715#true} assume 0 == ~mode1~0 % 256; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {63715#true} assume ~id2~0 >= 0; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {63715#true} assume 0 == ~st2~0; {63715#true} is VALID [2022-02-20 19:45:49,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {63715#true} assume ~send2~0 == ~id2~0; {63715#true} is VALID [2022-02-20 19:45:49,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {63715#true} assume 0 == ~mode2~0 % 256; {63715#true} is VALID [2022-02-20 19:45:49,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {63715#true} assume ~id3~0 >= 0; {63715#true} is VALID [2022-02-20 19:45:49,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {63715#true} assume 0 == ~st3~0; {63715#true} is VALID [2022-02-20 19:45:49,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {63715#true} assume ~send3~0 == ~id3~0; {63715#true} is VALID [2022-02-20 19:45:49,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {63715#true} assume 0 == ~mode3~0 % 256; {63715#true} is VALID [2022-02-20 19:45:49,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {63715#true} assume ~id4~0 >= 0; {63715#true} is VALID [2022-02-20 19:45:49,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {63715#true} assume 0 == ~st4~0; {63715#true} is VALID [2022-02-20 19:45:49,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {63715#true} assume ~send4~0 == ~id4~0; {63715#true} is VALID [2022-02-20 19:45:49,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {63715#true} assume 0 == ~mode4~0 % 256; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {63717#(= (+ (* (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; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {63717#(= (+ (* (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; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {63717#(= (+ (* (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; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {63717#(= (+ (* (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; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {63717#(= (+ (* (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; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {63717#(= (+ (* (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; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {63717#(= (+ (* (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; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {63717#(= (+ (* (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; {63717#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:49,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {63717#(= (+ (* (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; {63716#false} is VALID [2022-02-20 19:45:49,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {63716#false} assume node4_~m4~0#1 != ~nomsg~0; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {63716#false} assume !(node4_~m4~0#1 > ~id4~0); {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {63716#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {63716#false} ~mode4~0 := 0; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {63716#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; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {63716#false} assume !(0 != ~mode5~0 % 256); {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {63716#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 59: Hoare triple {63716#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {63716#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; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {63716#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {63716#false} check_#res#1 := check_~tmp~1#1; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {63716#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; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {63716#false} assume 0 == assert_~arg#1 % 256; {63716#false} is VALID [2022-02-20 19:45:49,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {63716#false} assume !false; {63716#false} is VALID [2022-02-20 19:45:49,520 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:49,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:49,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871385531] [2022-02-20 19:45:49,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871385531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:49,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:49,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:49,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567765073] [2022-02-20 19:45:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:49,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 19:45:49,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:49,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:49,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:49,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:49,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:49,561 INFO L87 Difference]: Start difference. First operand 2661 states and 4155 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:51,836 INFO L93 Difference]: Finished difference Result 3349 states and 5205 transitions. [2022-02-20 19:45:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:51,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 19:45:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:51,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions. [2022-02-20 19:45:53,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:53,403 INFO L225 Difference]: With dead ends: 3349 [2022-02-20 19:45:53,403 INFO L226 Difference]: Without dead ends: 2981 [2022-02-20 19:45:53,404 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:53,405 INFO L933 BasicCegarLoop]: 1591 mSDtfsCounter, 1502 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1686 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:53,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 1686 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:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states.