./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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 64562d20261a98c4fff8930ffc2f21f6ad2db9602778187addddf7335f143802 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:40:20,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:40:20,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:40:20,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:40:20,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:40:20,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:40:20,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:40:20,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:40:20,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:40:20,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:40:20,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:40:20,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:40:20,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:40:20,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:40:20,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:40:20,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:40:20,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:40:20,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:40:20,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:40:20,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:40:20,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:40:20,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:40:20,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:40:20,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:40:20,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:40:20,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:40:20,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:40:20,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:40:20,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:40:20,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:40:20,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:40:20,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:40:20,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:40:20,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:40:20,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:40:20,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:40:20,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:40:20,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:40:20,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:40:20,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:40:20,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:40:20,625 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:40:20,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:40:20,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:40:20,645 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:40:20,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:40:20,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:40:20,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:40:20,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:40:20,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:40:20,647 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:40:20,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:40:20,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:40:20,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:40:20,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:40:20,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:40:20,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:40:20,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:40:20,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:40:20,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:40:20,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:40:20,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:40:20,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:40:20,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:40:20,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:40:20,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:40:20,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:40:20,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:40:20,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:40:20,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:40:20,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:40:20,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:40:20,650 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:40:20,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:40:20,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:40:20,651 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 -> 64562d20261a98c4fff8930ffc2f21f6ad2db9602778187addddf7335f143802 [2022-02-20 19:40:20,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:40:20,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:40:20,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:40:20,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:40:20,826 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:40:20,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:40:20,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591a9707f/b9f4c2042e744b0c86205f0933e5244c/FLAG930f77ad1 [2022-02-20 19:40:21,456 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:40:21,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:40:21,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591a9707f/b9f4c2042e744b0c86205f0933e5244c/FLAG930f77ad1 [2022-02-20 19:40:21,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591a9707f/b9f4c2042e744b0c86205f0933e5244c [2022-02-20 19:40:21,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:40:21,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:40:21,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:21,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:40:21,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:40:21,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:21" (1/1) ... [2022-02-20 19:40:21,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55159bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:21, skipping insertion in model container [2022-02-20 19:40:21,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:21" (1/1) ... [2022-02-20 19:40:21,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:40:21,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:40:22,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[6524,6537] [2022-02-20 19:40:22,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[13460,13473] [2022-02-20 19:40:22,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:22,846 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:40:22,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[6524,6537] [2022-02-20 19:40:22,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[13460,13473] [2022-02-20 19:40:23,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:23,210 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:40:23,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23 WrapperNode [2022-02-20 19:40:23,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:23,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:23,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:40:23,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:40:23,216 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:40:23" (1/1) ... [2022-02-20 19:40:23,270 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:40:23" (1/1) ... [2022-02-20 19:40:23,543 INFO L137 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4974 [2022-02-20 19:40:23,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:23,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:40:23,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:40:23,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:40:23,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (1/1) ... [2022-02-20 19:40:23,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (1/1) ... [2022-02-20 19:40:23,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (1/1) ... [2022-02-20 19:40:23,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (1/1) ... [2022-02-20 19:40:23,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (1/1) ... [2022-02-20 19:40:23,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (1/1) ... [2022-02-20 19:40:23,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (1/1) ... [2022-02-20 19:40:23,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:40:23,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:40:23,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:40:23,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:40:23,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (1/1) ... [2022-02-20 19:40:23,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:40:23,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:40:23,880 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:40:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:40:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:40:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:40:23,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:40:23,907 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:40:24,008 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:40:24,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:40:30,432 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:40:30,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:40:30,450 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:40:30,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:30 BoogieIcfgContainer [2022-02-20 19:40:30,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:40:30,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:40:30,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:40:30,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:40:30,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:40:21" (1/3) ... [2022-02-20 19:40:30,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a5c83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:30, skipping insertion in model container [2022-02-20 19:40:30,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:23" (2/3) ... [2022-02-20 19:40:30,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a5c83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:30, skipping insertion in model container [2022-02-20 19:40:30,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:30" (3/3) ... [2022-02-20 19:40:30,459 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:40:30,463 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:40:30,463 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:40:30,509 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:40:30,524 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:40:30,526 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:40:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:30,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:30,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:30,571 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash 975463267, now seen corresponding path program 1 times [2022-02-20 19:40:30,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:30,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129306554] [2022-02-20 19:40:30,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:30,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {881#true} is VALID [2022-02-20 19:40:30,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {881#true} is VALID [2022-02-20 19:40:30,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {881#true} is VALID [2022-02-20 19:40:30,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {881#true} is VALID [2022-02-20 19:40:30,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#true} init_#res#1 := init_~tmp~0#1; {881#true} is VALID [2022-02-20 19:40:30,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {881#true} is VALID [2022-02-20 19:40:30,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {882#false} is VALID [2022-02-20 19:40:30,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#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;main1_~i2~0#1 := 0; {882#false} is VALID [2022-02-20 19:40:30,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:40:30,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {882#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {882#false} is VALID [2022-02-20 19:40:30,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {882#false} assume !(node1_~m1~0#1 != ~nomsg~0); {882#false} is VALID [2022-02-20 19:40:30,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {882#false} ~mode1~0 := 0; {882#false} is VALID [2022-02-20 19:40:30,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {882#false} is VALID [2022-02-20 19:40:30,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {882#false} assume !(0 != ~mode2~0 % 256); {882#false} is VALID [2022-02-20 19:40:30,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {882#false} is VALID [2022-02-20 19:40:30,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {882#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {882#false} is VALID [2022-02-20 19:40:30,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {882#false} is VALID [2022-02-20 19:40:30,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume !(0 != ~mode3~0 % 256); {882#false} is VALID [2022-02-20 19:40:30,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {882#false} is VALID [2022-02-20 19:40:30,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {882#false} is VALID [2022-02-20 19:40:30,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {882#false} is VALID [2022-02-20 19:40:30,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {882#false} is VALID [2022-02-20 19:40:30,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {882#false} check_#res#1 := check_~tmp~1#1; {882#false} is VALID [2022-02-20 19:40:30,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {882#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {882#false} is VALID [2022-02-20 19:40:30,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {882#false} assume 0 == assert_~arg#1 % 256; {882#false} is VALID [2022-02-20 19:40:30,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-02-20 19:40:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:30,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:30,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129306554] [2022-02-20 19:40:30,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129306554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:30,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:30,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:40:30,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91301958] [2022-02-20 19:40:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:40:30,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:30,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:30,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:30,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:40:30,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:40:30,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:40:30,762 INFO L87 Difference]: Start difference. First operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:32,237 INFO L93 Difference]: Finished difference Result 1732 states and 3290 transitions. [2022-02-20 19:40:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:40:32,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:40:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3290 transitions. [2022-02-20 19:40:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3290 transitions. [2022-02-20 19:40:32,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3290 transitions. [2022-02-20 19:40:34,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3290 edges. 3290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:34,878 INFO L225 Difference]: With dead ends: 1732 [2022-02-20 19:40:34,878 INFO L226 Difference]: Without dead ends: 812 [2022-02-20 19:40:34,885 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:40:34,888 INFO L933 BasicCegarLoop]: 1597 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, 1597 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:40:34,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-02-20 19:40:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-02-20 19:40:34,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:34,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:34,958 INFO L74 IsIncluded]: Start isIncluded. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:34,959 INFO L87 Difference]: Start difference. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:34,988 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions. [2022-02-20 19:40:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:40:34,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:34,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:34,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 812 states. [2022-02-20 19:40:34,998 INFO L87 Difference]: Start difference. First operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 812 states. [2022-02-20 19:40:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:35,025 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions. [2022-02-20 19:40:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:40:35,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:35,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:35,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:35,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1533 transitions. [2022-02-20 19:40:35,060 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1533 transitions. Word has length 26 [2022-02-20 19:40:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:35,061 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1533 transitions. [2022-02-20 19:40:35,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:40:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:35,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:35,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:35,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:40:35,068 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash 157814817, now seen corresponding path program 1 times [2022-02-20 19:40:35,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:35,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636369203] [2022-02-20 19:40:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:35,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {5091#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5091#true} is VALID [2022-02-20 19:40:35,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {5091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {5091#true} is VALID [2022-02-20 19:40:35,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {5091#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5091#true} is VALID [2022-02-20 19:40:35,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {5091#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5093#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:40:35,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {5093#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5094#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:40:35,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {5094#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {5095#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:40:35,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {5095#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5092#false} is VALID [2022-02-20 19:40:35,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {5092#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;main1_~i2~0#1 := 0; {5092#false} is VALID [2022-02-20 19:40:35,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:35,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {5092#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5092#false} is VALID [2022-02-20 19:40:35,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {5092#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5092#false} is VALID [2022-02-20 19:40:35,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {5092#false} ~mode1~0 := 0; {5092#false} is VALID [2022-02-20 19:40:35,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:35,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {5092#false} assume !(0 != ~mode2~0 % 256); {5092#false} is VALID [2022-02-20 19:40:35,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {5092#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5092#false} is VALID [2022-02-20 19:40:35,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:35,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:35,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {5092#false} assume !(0 != ~mode3~0 % 256); {5092#false} is VALID [2022-02-20 19:40:35,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {5092#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5092#false} is VALID [2022-02-20 19:40:35,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:35,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {5092#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5092#false} is VALID [2022-02-20 19:40:35,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {5092#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5092#false} is VALID [2022-02-20 19:40:35,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {5092#false} check_#res#1 := check_~tmp~1#1; {5092#false} is VALID [2022-02-20 19:40:35,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {5092#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5092#false} is VALID [2022-02-20 19:40:35,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {5092#false} assume 0 == assert_~arg#1 % 256; {5092#false} is VALID [2022-02-20 19:40:35,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {5092#false} assume !false; {5092#false} is VALID [2022-02-20 19:40:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:35,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:35,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636369203] [2022-02-20 19:40:35,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636369203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:35,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:35,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:35,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317708031] [2022-02-20 19:40:35,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:35,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:40:35,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:35,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:35,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:35,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:35,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:35,154 INFO L87 Difference]: Start difference. First operand 812 states and 1533 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:39,135 INFO L93 Difference]: Finished difference Result 852 states and 1593 transitions. [2022-02-20 19:40:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:40:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1593 transitions. [2022-02-20 19:40:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1593 transitions. [2022-02-20 19:40:39,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1593 transitions. [2022-02-20 19:40:40,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1593 edges. 1593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:40,432 INFO L225 Difference]: With dead ends: 852 [2022-02-20 19:40:40,432 INFO L226 Difference]: Without dead ends: 812 [2022-02-20 19:40:40,432 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:40:40,433 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 3 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:40,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-02-20 19:40:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-02-20 19:40:40,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:40,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,449 INFO L74 IsIncluded]: Start isIncluded. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,450 INFO L87 Difference]: Start difference. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:40,476 INFO L93 Difference]: Finished difference Result 812 states and 1517 transitions. [2022-02-20 19:40:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions. [2022-02-20 19:40:40,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:40,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:40,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 812 states. [2022-02-20 19:40:40,480 INFO L87 Difference]: Start difference. First operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 812 states. [2022-02-20 19:40:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:40,506 INFO L93 Difference]: Finished difference Result 812 states and 1517 transitions. [2022-02-20 19:40:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions. [2022-02-20 19:40:40,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:40,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:40,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:40,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1517 transitions. [2022-02-20 19:40:40,534 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1517 transitions. Word has length 26 [2022-02-20 19:40:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:40,534 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1517 transitions. [2022-02-20 19:40:40,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions. [2022-02-20 19:40:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:40,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:40,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:40,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:40:40,536 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1324654887, now seen corresponding path program 1 times [2022-02-20 19:40:40,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:40,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670423882] [2022-02-20 19:40:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:40,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {8421#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8421#true} is VALID [2022-02-20 19:40:40,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {8421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {8421#true} is VALID [2022-02-20 19:40:40,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {8421#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8421#true} is VALID [2022-02-20 19:40:40,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {8421#true} assume 0 == ~r1~0 % 256; {8421#true} is VALID [2022-02-20 19:40:40,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {8421#true} assume ~id1~0 >= 0; {8421#true} is VALID [2022-02-20 19:40:40,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {8421#true} assume 0 == ~st1~0; {8421#true} is VALID [2022-02-20 19:40:40,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {8421#true} assume ~send1~0 == ~id1~0; {8421#true} is VALID [2022-02-20 19:40:40,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {8421#true} assume 0 == ~mode1~0 % 256; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:40,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8422#false} is VALID [2022-02-20 19:40:40,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {8422#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8422#false} is VALID [2022-02-20 19:40:40,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {8422#false} ~mode1~0 := 0; {8422#false} is VALID [2022-02-20 19:40:40,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {8422#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; {8422#false} is VALID [2022-02-20 19:40:40,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {8422#false} assume !(0 != ~mode2~0 % 256); {8422#false} is VALID [2022-02-20 19:40:40,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {8422#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8422#false} is VALID [2022-02-20 19:40:40,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {8422#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; {8422#false} is VALID [2022-02-20 19:40:40,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {8422#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; {8422#false} is VALID [2022-02-20 19:40:40,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {8422#false} assume !(0 != ~mode3~0 % 256); {8422#false} is VALID [2022-02-20 19:40:40,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {8422#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8422#false} is VALID [2022-02-20 19:40:40,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {8422#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; {8422#false} is VALID [2022-02-20 19:40:40,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {8422#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8422#false} is VALID [2022-02-20 19:40:40,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {8422#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8422#false} is VALID [2022-02-20 19:40:40,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {8422#false} check_#res#1 := check_~tmp~1#1; {8422#false} is VALID [2022-02-20 19:40:40,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {8422#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8422#false} is VALID [2022-02-20 19:40:40,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {8422#false} assume 0 == assert_~arg#1 % 256; {8422#false} is VALID [2022-02-20 19:40:40,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {8422#false} assume !false; {8422#false} is VALID [2022-02-20 19:40:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:40,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:40,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670423882] [2022-02-20 19:40:40,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670423882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:40,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:40,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:40,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686349477] [2022-02-20 19:40:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:40,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:40,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:40,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:40,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:40,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:40,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:40,693 INFO L87 Difference]: Start difference. First operand 812 states and 1517 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:42,383 INFO L93 Difference]: Finished difference Result 878 states and 1619 transitions. [2022-02-20 19:40:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:42,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:42,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:40:43,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:43,893 INFO L225 Difference]: With dead ends: 878 [2022-02-20 19:40:43,894 INFO L226 Difference]: Without dead ends: 842 [2022-02-20 19:40:43,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:43,901 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1485 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:43,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1613 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-02-20 19:40:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 840. [2022-02-20 19:40:43,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:43,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 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:40:43,920 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 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:40:43,921 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 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:40:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:43,950 INFO L93 Difference]: Finished difference Result 842 states and 1562 transitions. [2022-02-20 19:40:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1562 transitions. [2022-02-20 19:40:43,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:43,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:43,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 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 842 states. [2022-02-20 19:40:43,954 INFO L87 Difference]: Start difference. First operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 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 842 states. [2022-02-20 19:40:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:43,984 INFO L93 Difference]: Finished difference Result 842 states and 1562 transitions. [2022-02-20 19:40:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1562 transitions. [2022-02-20 19:40:43,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:43,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:43,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:43,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 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:40:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1561 transitions. [2022-02-20 19:40:44,016 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1561 transitions. Word has length 41 [2022-02-20 19:40:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:44,017 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1561 transitions. [2022-02-20 19:40:44,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1561 transitions. [2022-02-20 19:40:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:44,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:44,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:44,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:40:44,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027727, now seen corresponding path program 1 times [2022-02-20 19:40:44,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:44,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865631251] [2022-02-20 19:40:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:44,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:44,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {11870#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {11870#true} is VALID [2022-02-20 19:40:44,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {11870#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {11870#true} is VALID [2022-02-20 19:40:44,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {11870#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {11870#true} is VALID [2022-02-20 19:40:44,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {11870#true} assume 0 == ~r1~0 % 256; {11870#true} is VALID [2022-02-20 19:40:44,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {11870#true} assume ~id1~0 >= 0; {11870#true} is VALID [2022-02-20 19:40:44,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {11870#true} assume 0 == ~st1~0; {11872#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:44,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {11872#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {11872#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:44,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {11872#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {11872#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:44,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {11872#(<= ~st1~0 0)} assume ~id2~0 >= 0; {11872#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:44,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {11872#(<= ~st1~0 0)} assume 0 == ~st2~0; {11873#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {11873#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {11873#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {11873#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {11873#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {11873#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {11873#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {11873#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {11874#(<= (+ ~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;main1_~i2~0#1 := 0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:44,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {11871#false} is VALID [2022-02-20 19:40:44,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {11871#false} check_#res#1 := check_~tmp~1#1; {11871#false} is VALID [2022-02-20 19:40:44,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {11871#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {11871#false} is VALID [2022-02-20 19:40:44,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {11871#false} assume 0 == assert_~arg#1 % 256; {11871#false} is VALID [2022-02-20 19:40:44,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {11871#false} assume !false; {11871#false} is VALID [2022-02-20 19:40:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:44,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:44,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865631251] [2022-02-20 19:40:44,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865631251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:44,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:44,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:44,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873133647] [2022-02-20 19:40:44,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:44,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:44,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:44,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:44,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:44,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:44,186 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:44,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:44,187 INFO L87 Difference]: Start difference. First operand 840 states and 1561 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:46,481 INFO L93 Difference]: Finished difference Result 1224 states and 2161 transitions. [2022-02-20 19:40:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:40:46,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:40:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:40:46,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1853 transitions. [2022-02-20 19:40:48,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1853 edges. 1853 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:48,050 INFO L225 Difference]: With dead ends: 1224 [2022-02-20 19:40:48,050 INFO L226 Difference]: Without dead ends: 1160 [2022-02-20 19:40:48,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:48,051 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 4709 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4709 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:48,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4709 Valid, 1779 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-02-20 19:40:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 902. [2022-02-20 19:40:48,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:48,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:48,092 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:48,093 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:48,135 INFO L93 Difference]: Finished difference Result 1160 states and 2049 transitions. [2022-02-20 19:40:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2049 transitions. [2022-02-20 19:40:48,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:48,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:48,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 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 1160 states. [2022-02-20 19:40:48,139 INFO L87 Difference]: Start difference. First operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 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 1160 states. [2022-02-20 19:40:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:48,180 INFO L93 Difference]: Finished difference Result 1160 states and 2049 transitions. [2022-02-20 19:40:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2049 transitions. [2022-02-20 19:40:48,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:48,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:48,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:48,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1656 transitions. [2022-02-20 19:40:48,213 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1656 transitions. Word has length 41 [2022-02-20 19:40:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:48,213 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1656 transitions. [2022-02-20 19:40:48,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1656 transitions. [2022-02-20 19:40:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:48,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:48,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:48,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:40:48,214 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1902982177, now seen corresponding path program 1 times [2022-02-20 19:40:48,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:48,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508486792] [2022-02-20 19:40:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:48,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {16450#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {16450#true} is VALID [2022-02-20 19:40:48,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {16450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {16450#true} is VALID [2022-02-20 19:40:48,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {16450#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16450#true} is VALID [2022-02-20 19:40:48,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {16450#true} assume 0 == ~r1~0 % 256; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {16452#(<= ~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;main1_~i2~0#1 := 0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:48,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {16451#false} is VALID [2022-02-20 19:40:48,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {16451#false} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {16451#false} is VALID [2022-02-20 19:40:48,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {16451#false} check_#res#1 := check_~tmp~1#1; {16451#false} is VALID [2022-02-20 19:40:48,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {16451#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16451#false} is VALID [2022-02-20 19:40:48,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {16451#false} assume 0 == assert_~arg#1 % 256; {16451#false} is VALID [2022-02-20 19:40:48,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {16451#false} assume !false; {16451#false} is VALID [2022-02-20 19:40:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:48,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:48,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508486792] [2022-02-20 19:40:48,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508486792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:48,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:48,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:48,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967034115] [2022-02-20 19:40:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:48,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:48,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:48,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:48,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:48,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:48,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:48,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:48,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:48,325 INFO L87 Difference]: Start difference. First operand 902 states and 1656 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:49,828 INFO L93 Difference]: Finished difference Result 1089 states and 1943 transitions. [2022-02-20 19:40:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:49,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:40:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:40:49,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1620 transitions. [2022-02-20 19:40:51,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1620 edges. 1620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:51,197 INFO L225 Difference]: With dead ends: 1089 [2022-02-20 19:40:51,197 INFO L226 Difference]: Without dead ends: 963 [2022-02-20 19:40:51,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:51,198 INFO L933 BasicCegarLoop]: 1514 mSDtfsCounter, 1469 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:51,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1565 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-02-20 19:40:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2022-02-20 19:40:51,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:51,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:51,266 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:51,267 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:51,297 INFO L93 Difference]: Finished difference Result 963 states and 1745 transitions. [2022-02-20 19:40:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1745 transitions. [2022-02-20 19:40:51,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:51,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:51,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:40:51,301 INFO L87 Difference]: Start difference. First operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:40:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:51,331 INFO L93 Difference]: Finished difference Result 963 states and 1745 transitions. [2022-02-20 19:40:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1745 transitions. [2022-02-20 19:40:51,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:51,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:51,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:51,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1744 transitions. [2022-02-20 19:40:51,382 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1744 transitions. Word has length 43 [2022-02-20 19:40:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:51,383 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1744 transitions. [2022-02-20 19:40:51,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1744 transitions. [2022-02-20 19:40:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:51,384 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:51,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:51,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:40:51,384 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:51,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:51,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488665, now seen corresponding path program 1 times [2022-02-20 19:40:51,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:51,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343348186] [2022-02-20 19:40:51,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:51,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:51,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {20539#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {20539#true} is VALID [2022-02-20 19:40:51,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {20539#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {20539#true} is VALID [2022-02-20 19:40:51,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {20539#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20539#true} is VALID [2022-02-20 19:40:51,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {20539#true} assume 0 == ~r1~0 % 256; {20539#true} is VALID [2022-02-20 19:40:51,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {20539#true} assume ~id1~0 >= 0; {20539#true} is VALID [2022-02-20 19:40:51,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {20539#true} assume 0 == ~st1~0; {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:51,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:51,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:51,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:51,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:51,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:51,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:51,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:51,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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;main1_~i2~0#1 := 0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:51,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {20540#false} is VALID [2022-02-20 19:40:51,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {20540#false} check_#res#1 := check_~tmp~1#1; {20540#false} is VALID [2022-02-20 19:40:51,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {20540#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {20540#false} is VALID [2022-02-20 19:40:51,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {20540#false} assume 0 == assert_~arg#1 % 256; {20540#false} is VALID [2022-02-20 19:40:51,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {20540#false} assume !false; {20540#false} is VALID [2022-02-20 19:40:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:51,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:51,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343348186] [2022-02-20 19:40:51,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343348186] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:51,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:51,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:51,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804978803] [2022-02-20 19:40:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:51,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:51,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:51,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:51,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:51,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:51,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:51,576 INFO L87 Difference]: Start difference. First operand 961 states and 1744 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:54,614 INFO L93 Difference]: Finished difference Result 1146 states and 2026 transitions. [2022-02-20 19:40:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:54,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:40:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:40:54,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1627 transitions. [2022-02-20 19:40:55,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1627 edges. 1627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:55,954 INFO L225 Difference]: With dead ends: 1146 [2022-02-20 19:40:55,954 INFO L226 Difference]: Without dead ends: 963 [2022-02-20 19:40:55,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:40:55,955 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 4476 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:55,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4476 Valid, 1633 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:40:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-02-20 19:40:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2022-02-20 19:40:56,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:56,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,020 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,021 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:56,049 INFO L93 Difference]: Finished difference Result 963 states and 1742 transitions. [2022-02-20 19:40:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1742 transitions. [2022-02-20 19:40:56,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:56,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:56,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:40:56,053 INFO L87 Difference]: Start difference. First operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:40:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:56,081 INFO L93 Difference]: Finished difference Result 963 states and 1742 transitions. [2022-02-20 19:40:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1742 transitions. [2022-02-20 19:40:56,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:56,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:56,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:56,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1741 transitions. [2022-02-20 19:40:56,113 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1741 transitions. Word has length 43 [2022-02-20 19:40:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:56,114 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1741 transitions. [2022-02-20 19:40:56,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1741 transitions. [2022-02-20 19:40:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:56,115 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:56,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:56,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:40:56,116 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash -47574589, now seen corresponding path program 1 times [2022-02-20 19:40:56,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:56,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747453451] [2022-02-20 19:40:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:56,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {24700#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {24700#true} is VALID [2022-02-20 19:40:56,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {24700#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {24700#true} is VALID [2022-02-20 19:40:56,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {24700#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {24700#true} is VALID [2022-02-20 19:40:56,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {24700#true} assume 0 == ~r1~0 % 256; {24700#true} is VALID [2022-02-20 19:40:56,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {24700#true} assume ~id1~0 >= 0; {24700#true} is VALID [2022-02-20 19:40:56,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {24700#true} assume 0 == ~st1~0; {24700#true} is VALID [2022-02-20 19:40:56,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {24700#true} assume ~send1~0 == ~id1~0; {24700#true} is VALID [2022-02-20 19:40:56,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {24700#true} assume 0 == ~mode1~0 % 256; {24700#true} is VALID [2022-02-20 19:40:56,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {24700#true} assume ~id2~0 >= 0; {24700#true} is VALID [2022-02-20 19:40:56,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {24700#true} assume 0 == ~st2~0; {24700#true} is VALID [2022-02-20 19:40:56,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {24700#true} assume ~send2~0 == ~id2~0; {24700#true} is VALID [2022-02-20 19:40:56,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {24700#true} assume 0 == ~mode2~0 % 256; {24700#true} is VALID [2022-02-20 19:40:56,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {24700#true} assume ~id3~0 >= 0; {24700#true} is VALID [2022-02-20 19:40:56,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {24700#true} assume 0 == ~st3~0; {24700#true} is VALID [2022-02-20 19:40:56,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {24700#true} assume ~send3~0 == ~id3~0; {24700#true} is VALID [2022-02-20 19:40:56,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {24700#true} assume 0 == ~mode3~0 % 256; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:56,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {24701#false} is VALID [2022-02-20 19:40:56,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {24701#false} assume node3_~m3~0#1 != ~nomsg~0; {24701#false} is VALID [2022-02-20 19:40:56,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {24701#false} assume !(node3_~m3~0#1 > ~id3~0); {24701#false} is VALID [2022-02-20 19:40:56,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {24701#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {24701#false} is VALID [2022-02-20 19:40:56,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {24701#false} ~mode3~0 := 0; {24701#false} is VALID [2022-02-20 19:40:56,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {24701#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {24701#false} is VALID [2022-02-20 19:40:56,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {24701#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {24701#false} is VALID [2022-02-20 19:40:56,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {24701#false} check_#res#1 := check_~tmp~1#1; {24701#false} is VALID [2022-02-20 19:40:56,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {24701#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {24701#false} is VALID [2022-02-20 19:40:56,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {24701#false} assume 0 == assert_~arg#1 % 256; {24701#false} is VALID [2022-02-20 19:40:56,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {24701#false} assume !false; {24701#false} is VALID [2022-02-20 19:40:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:56,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:56,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747453451] [2022-02-20 19:40:56,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747453451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:56,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:56,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:56,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463274134] [2022-02-20 19:40:56,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:56,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:56,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:56,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:56,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:56,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:56,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:56,222 INFO L87 Difference]: Start difference. First operand 961 states and 1741 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:57,896 INFO L93 Difference]: Finished difference Result 1291 states and 2237 transitions. [2022-02-20 19:40:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:57,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:40:59,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:59,391 INFO L225 Difference]: With dead ends: 1291 [2022-02-20 19:40:59,391 INFO L226 Difference]: Without dead ends: 1108 [2022-02-20 19:40:59,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:59,392 INFO L933 BasicCegarLoop]: 1541 mSDtfsCounter, 1477 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:59,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 1603 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-02-20 19:40:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2022-02-20 19:40:59,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:59,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:59,505 INFO L74 IsIncluded]: Start isIncluded. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:59,506 INFO L87 Difference]: Start difference. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:59,541 INFO L93 Difference]: Finished difference Result 1108 states and 1953 transitions. [2022-02-20 19:40:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1953 transitions. [2022-02-20 19:40:59,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:59,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:59,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 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 1108 states. [2022-02-20 19:40:59,546 INFO L87 Difference]: Start difference. First operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 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 1108 states. [2022-02-20 19:40:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:59,583 INFO L93 Difference]: Finished difference Result 1108 states and 1953 transitions. [2022-02-20 19:40:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1953 transitions. [2022-02-20 19:40:59,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:59,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:59,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:59,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1952 transitions. [2022-02-20 19:40:59,626 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1952 transitions. Word has length 43 [2022-02-20 19:40:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:59,626 INFO L470 AbstractCegarLoop]: Abstraction has 1106 states and 1952 transitions. [2022-02-20 19:40:59,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1952 transitions. [2022-02-20 19:40:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:59,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:59,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:59,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:40:59,628 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1199933027, now seen corresponding path program 1 times [2022-02-20 19:40:59,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:59,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240984209] [2022-02-20 19:40:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:59,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {29507#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29507#true} is VALID [2022-02-20 19:40:59,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {29507#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {29507#true} is VALID [2022-02-20 19:40:59,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {29507#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29507#true} is VALID [2022-02-20 19:40:59,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {29507#true} assume 0 == ~r1~0 % 256; {29507#true} is VALID [2022-02-20 19:40:59,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {29507#true} assume ~id1~0 >= 0; {29507#true} is VALID [2022-02-20 19:40:59,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {29507#true} assume 0 == ~st1~0; {29507#true} is VALID [2022-02-20 19:40:59,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {29507#true} assume ~send1~0 == ~id1~0; {29507#true} is VALID [2022-02-20 19:40:59,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {29507#true} assume 0 == ~mode1~0 % 256; {29507#true} is VALID [2022-02-20 19:40:59,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {29507#true} assume ~id2~0 >= 0; {29507#true} is VALID [2022-02-20 19:40:59,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {29507#true} assume 0 == ~st2~0; {29507#true} is VALID [2022-02-20 19:40:59,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {29507#true} assume ~send2~0 == ~id2~0; {29507#true} is VALID [2022-02-20 19:40:59,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {29507#true} assume 0 == ~mode2~0 % 256; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:59,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {29508#false} is VALID [2022-02-20 19:40:59,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {29508#false} assume node2_~m2~0#1 != ~nomsg~0; {29508#false} is VALID [2022-02-20 19:40:59,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {29508#false} assume !(node2_~m2~0#1 > ~id2~0); {29508#false} is VALID [2022-02-20 19:40:59,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {29508#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {29508#false} is VALID [2022-02-20 19:40:59,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {29508#false} ~mode2~0 := 0; {29508#false} is VALID [2022-02-20 19:40:59,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {29508#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; {29508#false} is VALID [2022-02-20 19:40:59,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {29508#false} assume !(0 != ~mode3~0 % 256); {29508#false} is VALID [2022-02-20 19:40:59,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {29508#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29508#false} is VALID [2022-02-20 19:40:59,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {29508#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; {29508#false} is VALID [2022-02-20 19:40:59,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {29508#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29508#false} is VALID [2022-02-20 19:40:59,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {29508#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {29508#false} is VALID [2022-02-20 19:40:59,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {29508#false} check_#res#1 := check_~tmp~1#1; {29508#false} is VALID [2022-02-20 19:40:59,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {29508#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29508#false} is VALID [2022-02-20 19:40:59,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {29508#false} assume 0 == assert_~arg#1 % 256; {29508#false} is VALID [2022-02-20 19:40:59,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {29508#false} assume !false; {29508#false} is VALID [2022-02-20 19:40:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:59,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:59,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240984209] [2022-02-20 19:40:59,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240984209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:59,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:59,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:59,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363387271] [2022-02-20 19:40:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:59,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:59,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:59,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:59,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:59,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:59,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:59,707 INFO L87 Difference]: Start difference. First operand 1106 states and 1952 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:01,546 INFO L93 Difference]: Finished difference Result 1690 states and 2810 transitions. [2022-02-20 19:41:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:41:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:41:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:41:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:41:01,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:41:02,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:02,958 INFO L225 Difference]: With dead ends: 1690 [2022-02-20 19:41:02,958 INFO L226 Difference]: Without dead ends: 1362 [2022-02-20 19:41:02,959 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:41:02,959 INFO L933 BasicCegarLoop]: 1554 mSDtfsCounter, 1481 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1612 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:41:02,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1481 Valid, 1612 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2022-02-20 19:41:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1360. [2022-02-20 19:41:03,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:03,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:03,148 INFO L74 IsIncluded]: Start isIncluded. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:03,149 INFO L87 Difference]: Start difference. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:03,199 INFO L93 Difference]: Finished difference Result 1362 states and 2309 transitions. [2022-02-20 19:41:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2309 transitions. [2022-02-20 19:41:03,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:03,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:03,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 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 1362 states. [2022-02-20 19:41:03,203 INFO L87 Difference]: Start difference. First operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 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 1362 states. [2022-02-20 19:41:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:03,253 INFO L93 Difference]: Finished difference Result 1362 states and 2309 transitions. [2022-02-20 19:41:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2309 transitions. [2022-02-20 19:41:03,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:03,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:03,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:03,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2308 transitions. [2022-02-20 19:41:03,311 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2308 transitions. Word has length 43 [2022-02-20 19:41:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:03,311 INFO L470 AbstractCegarLoop]: Abstraction has 1360 states and 2308 transitions. [2022-02-20 19:41:03,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2308 transitions. [2022-02-20 19:41:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:41:03,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:03,312 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] [2022-02-20 19:41:03,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:41:03,312 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1511296967, now seen corresponding path program 1 times [2022-02-20 19:41:03,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:03,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361892371] [2022-02-20 19:41:03,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:03,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:03,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {35650#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {35650#true} is VALID [2022-02-20 19:41:03,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {35650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {35650#true} is VALID [2022-02-20 19:41:03,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {35650#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {35650#true} is VALID [2022-02-20 19:41:03,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {35650#true} assume 0 == ~r1~0 % 256; {35650#true} is VALID [2022-02-20 19:41:03,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {35650#true} assume ~id1~0 >= 0; {35650#true} is VALID [2022-02-20 19:41:03,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {35650#true} assume 0 == ~st1~0; {35650#true} is VALID [2022-02-20 19:41:03,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {35650#true} assume ~send1~0 == ~id1~0; {35650#true} is VALID [2022-02-20 19:41:03,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {35650#true} assume 0 == ~mode1~0 % 256; {35650#true} is VALID [2022-02-20 19:41:03,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {35650#true} assume ~id2~0 >= 0; {35650#true} is VALID [2022-02-20 19:41:03,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {35650#true} assume 0 == ~st2~0; {35650#true} is VALID [2022-02-20 19:41:03,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {35650#true} assume ~send2~0 == ~id2~0; {35650#true} is VALID [2022-02-20 19:41:03,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {35650#true} assume 0 == ~mode2~0 % 256; {35650#true} is VALID [2022-02-20 19:41:03,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {35650#true} assume ~id3~0 >= 0; {35650#true} is VALID [2022-02-20 19:41:03,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {35650#true} assume 0 == ~st3~0; {35650#true} is VALID [2022-02-20 19:41:03,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {35650#true} assume ~send3~0 == ~id3~0; {35650#true} is VALID [2022-02-20 19:41:03,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {35650#true} assume 0 == ~mode3~0 % 256; {35650#true} is VALID [2022-02-20 19:41:03,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {35650#true} assume ~id1~0 != ~id2~0; {35650#true} is VALID [2022-02-20 19:41:03,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {35650#true} assume ~id1~0 != ~id3~0; {35650#true} is VALID [2022-02-20 19:41:03,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {35650#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {35652#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:41:03,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {35652#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {35653#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:41:03,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {35653#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {35654#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:41:03,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {35654#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {35650#true} is VALID [2022-02-20 19:41:03,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {35650#true} 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;main1_~i2~0#1 := 0; {35650#true} is VALID [2022-02-20 19:41:03,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {35650#true} 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; {35650#true} is VALID [2022-02-20 19:41:03,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {35650#true} assume !(0 != ~mode1~0 % 256); {35650#true} is VALID [2022-02-20 19:41:03,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {35650#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {35650#true} is VALID [2022-02-20 19:41:03,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {35650#true} ~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; {35650#true} is VALID [2022-02-20 19:41:03,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {35650#true} 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; {35650#true} is VALID [2022-02-20 19:41:03,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {35650#true} assume !(0 != ~mode2~0 % 256); {35650#true} is VALID [2022-02-20 19:41:03,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {35650#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {35650#true} is VALID [2022-02-20 19:41:03,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {35650#true} ~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; {35650#true} is VALID [2022-02-20 19:41:03,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {35650#true} 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; {35650#true} is VALID [2022-02-20 19:41:03,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {35650#true} assume !(0 != ~mode3~0 % 256); {35650#true} is VALID [2022-02-20 19:41:03,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {35650#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {35650#true} is VALID [2022-02-20 19:41:03,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {35650#true} ~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; {35650#true} is VALID [2022-02-20 19:41:03,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {35650#true} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {35650#true} is VALID [2022-02-20 19:41:03,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {35650#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35650#true} is VALID [2022-02-20 19:41:03,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {35650#true} assume !(~r1~0 % 256 >= 3); {35650#true} is VALID [2022-02-20 19:41:03,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {35650#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {35650#true} is VALID [2022-02-20 19:41:03,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {35650#true} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {35655#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:41:03,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {35655#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {35656#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:41:03,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {35656#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {35657#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:41:03,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {35657#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {35651#false} is VALID [2022-02-20 19:41:03,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {35651#false} assume !false; {35651#false} is VALID [2022-02-20 19:41:03,403 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:41:03,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:03,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361892371] [2022-02-20 19:41:03,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361892371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:03,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:03,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:41:03,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788079035] [2022-02-20 19:41:03,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:41:03,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:03,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:03,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:03,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:41:03,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:03,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:41:03,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:41:03,429 INFO L87 Difference]: Start difference. First operand 1360 states and 2308 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:10,487 INFO L93 Difference]: Finished difference Result 1883 states and 3036 transitions. [2022-02-20 19:41:10,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:41:10,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:41:10,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:41:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:41:10,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1577 transitions. [2022-02-20 19:41:11,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1577 edges. 1577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:11,825 INFO L225 Difference]: With dead ends: 1883 [2022-02-20 19:41:11,825 INFO L226 Difference]: Without dead ends: 1881 [2022-02-20 19:41:11,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:41:11,826 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 424 mSDsluCounter, 8903 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 10434 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:41:11,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 10434 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2022-02-20 19:41:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1408. [2022-02-20 19:41:12,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:12,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:12,210 INFO L74 IsIncluded]: Start isIncluded. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:12,212 INFO L87 Difference]: Start difference. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:12,313 INFO L93 Difference]: Finished difference Result 1881 states and 3015 transitions. [2022-02-20 19:41:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3015 transitions. [2022-02-20 19:41:12,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:12,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:12,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 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 1881 states. [2022-02-20 19:41:12,319 INFO L87 Difference]: Start difference. First operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 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 1881 states. [2022-02-20 19:41:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:12,420 INFO L93 Difference]: Finished difference Result 1881 states and 3015 transitions. [2022-02-20 19:41:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3015 transitions. [2022-02-20 19:41:12,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:12,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:12,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:12,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2352 transitions. [2022-02-20 19:41:12,483 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2352 transitions. Word has length 44 [2022-02-20 19:41:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:12,483 INFO L470 AbstractCegarLoop]: Abstraction has 1408 states and 2352 transitions. [2022-02-20 19:41:12,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2352 transitions. [2022-02-20 19:41:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 19:41:12,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:12,484 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] [2022-02-20 19:41:12,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:41:12,484 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1100178715, now seen corresponding path program 1 times [2022-02-20 19:41:12,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:12,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032559565] [2022-02-20 19:41:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:12,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {43187#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {43189#(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~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet35#1, main2_#t~ret36#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {43189#(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~nondet35#1 && main2_#t~nondet35#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet35#1;havoc main2_#t~nondet35#1; {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {43189#(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~ret32#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {43189#(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); {43189#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:41:12,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {43189#(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); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,640 INFO L290 TraceCheckUtils]: 55: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {43190#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:41:12,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {43190#(not (= (+ (- 3) ~a5~0) 0))} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {43188#false} is VALID [2022-02-20 19:41:12,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {43188#false} assume !false; {43188#false} is VALID [2022-02-20 19:41:12,641 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:41:12,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:12,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032559565] [2022-02-20 19:41:12,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032559565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:12,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:12,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:41:12,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586393094] [2022-02-20 19:41:12,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:12,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 19:41:12,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:12,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:12,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:12,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:41:12,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:41:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:41:12,690 INFO L87 Difference]: Start difference. First operand 1408 states and 2352 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:23,023 INFO L93 Difference]: Finished difference Result 3663 states and 6661 transitions. [2022-02-20 19:41:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:41:23,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 19:41:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5826 transitions. [2022-02-20 19:41:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5826 transitions. [2022-02-20 19:41:23,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5826 transitions. [2022-02-20 19:41:26,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5826 edges. 5826 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:26,482 INFO L225 Difference]: With dead ends: 3663 [2022-02-20 19:41:26,482 INFO L226 Difference]: Without dead ends: 2910 [2022-02-20 19:41:26,483 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:41:26,484 INFO L933 BasicCegarLoop]: 753 mSDtfsCounter, 2341 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2341 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:41:26,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2341 Valid, 771 Invalid, 6515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-02-20 19:41:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-02-20 19:41:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-02-20 19:41:26,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:26,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2910 states. Second operand has 2910 states, 2908 states have (on average 1.5357634112792298) internal successors, (4466), 2909 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:26,873 INFO L74 IsIncluded]: Start isIncluded. First operand 2910 states. Second operand has 2910 states, 2908 states have (on average 1.5357634112792298) internal successors, (4466), 2909 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:26,875 INFO L87 Difference]: Start difference. First operand 2910 states. Second operand has 2910 states, 2908 states have (on average 1.5357634112792298) internal successors, (4466), 2909 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:27,092 INFO L93 Difference]: Finished difference Result 2910 states and 4466 transitions. [2022-02-20 19:41:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4466 transitions. [2022-02-20 19:41:27,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:27,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:27,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 2910 states, 2908 states have (on average 1.5357634112792298) internal successors, (4466), 2909 states have internal predecessors, (4466), 0 states have call successors, (0), 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 2910 states. [2022-02-20 19:41:27,099 INFO L87 Difference]: Start difference. First operand has 2910 states, 2908 states have (on average 1.5357634112792298) internal successors, (4466), 2909 states have internal predecessors, (4466), 0 states have call successors, (0), 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 2910 states. [2022-02-20 19:41:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:27,325 INFO L93 Difference]: Finished difference Result 2910 states and 4466 transitions. [2022-02-20 19:41:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4466 transitions. [2022-02-20 19:41:27,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:27,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:27,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:27,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.5357634112792298) internal successors, (4466), 2909 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4466 transitions. [2022-02-20 19:41:27,577 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4466 transitions. Word has length 60 [2022-02-20 19:41:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:27,578 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4466 transitions. [2022-02-20 19:41:27,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4466 transitions. [2022-02-20 19:41:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:41:27,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:27,579 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:27,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:41:27,579 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:27,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash -213997176, now seen corresponding path program 1 times [2022-02-20 19:41:27,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:27,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759992560] [2022-02-20 19:41:27,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:27,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:27,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {55939#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {55939#true} is VALID [2022-02-20 19:41:27,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {55939#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {55939#true} is VALID [2022-02-20 19:41:27,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {55939#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {55939#true} is VALID [2022-02-20 19:41:27,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {55939#true} assume 0 == ~r1~0 % 256; {55939#true} is VALID [2022-02-20 19:41:27,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {55939#true} assume ~id1~0 >= 0; {55939#true} is VALID [2022-02-20 19:41:27,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {55939#true} assume 0 == ~st1~0; {55941#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:27,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {55941#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {55941#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:27,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {55941#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {55941#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:27,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {55941#(<= ~st1~0 0)} assume ~id2~0 >= 0; {55941#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:27,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {55941#(<= ~st1~0 0)} assume 0 == ~st2~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {55942#(<= (+ ~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;main1_~i2~0#1 := 0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {55942#(<= (+ ~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; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {55942#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:27,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {55942#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {55943#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:41:27,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {55943#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {55943#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:41:27,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {55943#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {55943#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:41:27,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {55943#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {55940#false} is VALID [2022-02-20 19:41:27,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {55940#false} check_#res#1 := check_~tmp~1#1; {55940#false} is VALID [2022-02-20 19:41:27,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {55940#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {55940#false} is VALID [2022-02-20 19:41:27,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {55940#false} assume 0 == assert_~arg#1 % 256; {55940#false} is VALID [2022-02-20 19:41:27,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {55940#false} assume !false; {55940#false} is VALID [2022-02-20 19:41:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 19:41:27,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:27,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759992560] [2022-02-20 19:41:27,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759992560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:27,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:27,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:41:27,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164463854] [2022-02-20 19:41:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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:41:27,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:27,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:27,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:27,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:41:27,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:27,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:41:27,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:41:27,735 INFO L87 Difference]: Start difference. First operand 2910 states and 4466 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)