./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.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 1a770e072308583e36326282bebae23c1c98c748d42f3621fe7141c74e78b303 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:39:07,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:39:07,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:39:07,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:39:07,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:39:07,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:39:07,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:39:07,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:39:07,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:39:07,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:39:07,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:39:07,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:39:07,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:39:07,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:39:07,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:39:07,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:39:07,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:39:07,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:39:07,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:39:07,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:39:07,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:39:07,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:39:07,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:39:07,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:39:07,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:39:07,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:39:07,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:39:07,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:39:07,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:39:07,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:39:07,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:39:07,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:39:07,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:39:07,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:39:07,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:39:07,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:39:07,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:39:07,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:39:07,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:39:07,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:39:07,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:39:07,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:39:07,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:39:07,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:39:07,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:39:07,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:39:07,794 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:39:07,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:39:07,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:39:07,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:39:07,794 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:39:07,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:39:07,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:39:07,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:39:07,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:39:07,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:39:07,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:39:07,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:39:07,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:39:07,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:39:07,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:39:07,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:39:07,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:39:07,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:39:07,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:39:07,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:39:07,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:07,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:39:07,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:39:07,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:39:07,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:39:07,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:39:07,799 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:39:07,799 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:39:07,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:39:07,800 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 -> 1a770e072308583e36326282bebae23c1c98c748d42f3621fe7141c74e78b303 [2022-02-20 19:39:08,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:39:08,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:39:08,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:39:08,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:39:08,037 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:39:08,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2022-02-20 19:39:08,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/470caec08/681996cab4194db5bd7cf3d5eb271447/FLAGd2ba70b5a [2022-02-20 19:39:08,627 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:39:08,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2022-02-20 19:39:08,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/470caec08/681996cab4194db5bd7cf3d5eb271447/FLAGd2ba70b5a [2022-02-20 19:39:09,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/470caec08/681996cab4194db5bd7cf3d5eb271447 [2022-02-20 19:39:09,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:39:09,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:39:09,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:09,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:39:09,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:39:09,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:09" (1/1) ... [2022-02-20 19:39:09,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751ce483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:09, skipping insertion in model container [2022-02-20 19:39:09,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:09" (1/1) ... [2022-02-20 19:39:09,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:39:09,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:39:09,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c[6354,6367] [2022-02-20 19:39:09,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c[7196,7209] [2022-02-20 19:39:10,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:10,047 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:39:10,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c[6354,6367] [2022-02-20 19:39:10,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c[7196,7209] [2022-02-20 19:39:10,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:10,381 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:39:10,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10 WrapperNode [2022-02-20 19:39:10,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:10,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:10,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:39:10,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:39:10,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:10,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:10,807 INFO L137 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4976 [2022-02-20 19:39:10,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:10,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:39:10,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:39:10,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:39:10,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:10,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:10,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:10,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:10,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:11,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:11,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:11,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:39:11,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:39:11,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:39:11,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:39:11,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (1/1) ... [2022-02-20 19:39:11,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:11,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:39:11,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:39:11,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:39:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:39:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:39:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:39:11,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:39:11,314 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:39:11,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:39:17,655 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:39:17,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:39:17,666 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:39:17,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:17 BoogieIcfgContainer [2022-02-20 19:39:17,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:39:17,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:39:17,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:39:17,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:39:17,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:39:09" (1/3) ... [2022-02-20 19:39:17,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140e4aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:17, skipping insertion in model container [2022-02-20 19:39:17,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:10" (2/3) ... [2022-02-20 19:39:17,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140e4aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:17, skipping insertion in model container [2022-02-20 19:39:17,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:17" (3/3) ... [2022-02-20 19:39:17,674 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2022-02-20 19:39:17,677 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:39:17,677 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:39:17,708 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:39:17,712 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:39:17,712 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:39:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 19:39:17,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:17,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:17,743 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2057058801, now seen corresponding path program 1 times [2022-02-20 19:39:17,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:17,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231001739] [2022-02-20 19:39:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:17,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:17,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {883#(<= ~a7~0 13)} is VALID [2022-02-20 19:39:17,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#(<= ~a7~0 13)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {883#(<= ~a7~0 13)} is VALID [2022-02-20 19:39:17,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#(<= ~a7~0 13)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet36#1, main2_#t~ret37#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {883#(<= ~a7~0 13)} is VALID [2022-02-20 19:39:17,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#(<= ~a7~0 13)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet36#1 && main2_#t~nondet36#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet36#1;havoc main2_#t~nondet36#1; {883#(<= ~a7~0 13)} is VALID [2022-02-20 19:39:17,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {883#(<= ~a7~0 13)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret33#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {883#(<= ~a7~0 13)} is VALID [2022-02-20 19:39:17,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#(<= ~a7~0 13)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {882#false} is VALID [2022-02-20 19:39:17,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-02-20 19:39:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:17,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:17,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231001739] [2022-02-20 19:39:17,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231001739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:17,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:17,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:39:17,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095055474] [2022-02-20 19:39:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 19:39:17,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:17,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:17,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:17,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:17,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:17,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:17,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:17,972 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:23,482 INFO L93 Difference]: Finished difference Result 2489 states and 4794 transitions. [2022-02-20 19:39:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:23,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 19:39:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4794 transitions. [2022-02-20 19:39:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4794 transitions. [2022-02-20 19:39:23,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4794 transitions. [2022-02-20 19:39:27,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4794 edges. 4794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:27,236 INFO L225 Difference]: With dead ends: 2489 [2022-02-20 19:39:27,236 INFO L226 Difference]: Without dead ends: 1563 [2022-02-20 19:39:27,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:27,246 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 950 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:27,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 201 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-02-20 19:39:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-02-20 19:39:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-02-20 19:39:27,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:27,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.862908392056374) internal successors, (2908), 1562 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:27,328 INFO L74 IsIncluded]: Start isIncluded. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.862908392056374) internal successors, (2908), 1562 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:27,330 INFO L87 Difference]: Start difference. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.862908392056374) internal successors, (2908), 1562 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:27,409 INFO L93 Difference]: Finished difference Result 1563 states and 2908 transitions. [2022-02-20 19:39:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2908 transitions. [2022-02-20 19:39:27,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:27,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:27,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 1563 states, 1561 states have (on average 1.862908392056374) internal successors, (2908), 1562 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1563 states. [2022-02-20 19:39:27,424 INFO L87 Difference]: Start difference. First operand has 1563 states, 1561 states have (on average 1.862908392056374) internal successors, (2908), 1562 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1563 states. [2022-02-20 19:39:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:27,498 INFO L93 Difference]: Finished difference Result 1563 states and 2908 transitions. [2022-02-20 19:39:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2908 transitions. [2022-02-20 19:39:27,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:27,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:27,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:27,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 1.862908392056374) internal successors, (2908), 1562 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2908 transitions. [2022-02-20 19:39:27,626 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2908 transitions. Word has length 7 [2022-02-20 19:39:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:27,626 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 2908 transitions. [2022-02-20 19:39:27,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2908 transitions. [2022-02-20 19:39:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:39:27,628 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:27,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:27,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:39:27,629 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash 157814817, now seen corresponding path program 1 times [2022-02-20 19:39:27,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:27,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824402566] [2022-02-20 19:39:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:27,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {8114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8114#true} is VALID [2022-02-20 19:39:27,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {8114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {8114#true} is VALID [2022-02-20 19:39:27,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {8114#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8114#true} is VALID [2022-02-20 19:39:27,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {8114#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8116#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:39:27,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {8116#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8117#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:39:27,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {8117#(= |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; {8118#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID [2022-02-20 19:39:27,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {8118#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {8115#false} is VALID [2022-02-20 19:39:27,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8115#false} is VALID [2022-02-20 19:39:27,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {8115#false} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8115#false} is VALID [2022-02-20 19:39:27,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8115#false} is VALID [2022-02-20 19:39:27,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8115#false} is VALID [2022-02-20 19:39:27,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#false} ~mode1~0 := 0; {8115#false} is VALID [2022-02-20 19:39:27,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:39:27,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {8115#false} assume !(0 != ~mode2~0 % 256); {8115#false} is VALID [2022-02-20 19:39:27,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8115#false} is VALID [2022-02-20 19:39:27,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:39:27,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:39:27,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {8115#false} assume !(0 != ~mode3~0 % 256); {8115#false} is VALID [2022-02-20 19:39:27,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {8115#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8115#false} is VALID [2022-02-20 19:39:27,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:39:27,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:39:27,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8115#false} is VALID [2022-02-20 19:39:27,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {8115#false} check_#res#1 := check_~tmp~1#1; {8115#false} is VALID [2022-02-20 19:39:27,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:39:27,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {8115#false} assume 0 == assert_~arg#1 % 256; {8115#false} is VALID [2022-02-20 19:39:27,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {8115#false} assume !false; {8115#false} is VALID [2022-02-20 19:39:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:27,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:27,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824402566] [2022-02-20 19:39:27,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824402566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:27,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:27,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:27,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593321336] [2022-02-20 19:39:27,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:27,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:39:27,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:27,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:27,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:27,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:27,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:27,756 INFO L87 Difference]: Start difference. First operand 1563 states and 2908 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:31,586 INFO L93 Difference]: Finished difference Result 1639 states and 3024 transitions. [2022-02-20 19:39:31,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:39:31,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:39:31,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:39:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:39:31,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1649 transitions. [2022-02-20 19:39:32,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1649 edges. 1649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:32,863 INFO L225 Difference]: With dead ends: 1639 [2022-02-20 19:39:32,863 INFO L226 Difference]: Without dead ends: 1599 [2022-02-20 19:39:32,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:39:32,869 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 58 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:32,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 6095 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2022-02-20 19:39:32,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1563. [2022-02-20 19:39:32,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:32,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.8526585522101218) internal successors, (2892), 1562 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:32,899 INFO L74 IsIncluded]: Start isIncluded. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.8526585522101218) internal successors, (2892), 1562 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:32,901 INFO L87 Difference]: Start difference. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.8526585522101218) internal successors, (2892), 1562 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:32,973 INFO L93 Difference]: Finished difference Result 1599 states and 2948 transitions. [2022-02-20 19:39:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2948 transitions. [2022-02-20 19:39:32,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:32,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:32,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 1563 states, 1561 states have (on average 1.8526585522101218) internal successors, (2892), 1562 states have internal predecessors, (2892), 0 states have call successors, (0), 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 1599 states. [2022-02-20 19:39:32,979 INFO L87 Difference]: Start difference. First operand has 1563 states, 1561 states have (on average 1.8526585522101218) internal successors, (2892), 1562 states have internal predecessors, (2892), 0 states have call successors, (0), 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 1599 states. [2022-02-20 19:39:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:33,057 INFO L93 Difference]: Finished difference Result 1599 states and 2948 transitions. [2022-02-20 19:39:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2948 transitions. [2022-02-20 19:39:33,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:33,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:33,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:33,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 1.8526585522101218) internal successors, (2892), 1562 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2892 transitions. [2022-02-20 19:39:33,131 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2892 transitions. Word has length 26 [2022-02-20 19:39:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:33,131 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 2892 transitions. [2022-02-20 19:39:33,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2892 transitions. [2022-02-20 19:39:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:33,132 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:33,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:33,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:39:33,133 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:33,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1324654887, now seen corresponding path program 1 times [2022-02-20 19:39:33,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:33,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911219090] [2022-02-20 19:39:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:33,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:33,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {14572#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {14572#true} is VALID [2022-02-20 19:39:33,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {14572#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {14572#true} is VALID [2022-02-20 19:39:33,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {14572#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14572#true} is VALID [2022-02-20 19:39:33,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {14572#true} assume 0 == ~r1~0; {14572#true} is VALID [2022-02-20 19:39:33,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {14572#true} assume ~id1~0 >= 0; {14572#true} is VALID [2022-02-20 19:39:33,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {14572#true} assume 0 == ~st1~0; {14572#true} is VALID [2022-02-20 19:39:33,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {14572#true} assume ~send1~0 == ~id1~0; {14572#true} is VALID [2022-02-20 19:39:33,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {14572#true} assume 0 == ~mode1~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {14574#(= (+ (* (- 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; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:33,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14573#false} is VALID [2022-02-20 19:39:33,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {14573#false} assume !(node1_~m1~0#1 != ~nomsg~0); {14573#false} is VALID [2022-02-20 19:39:33,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {14573#false} ~mode1~0 := 0; {14573#false} is VALID [2022-02-20 19:39:33,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:39:33,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {14573#false} assume !(0 != ~mode2~0 % 256); {14573#false} is VALID [2022-02-20 19:39:33,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {14573#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14573#false} is VALID [2022-02-20 19:39:33,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:39:33,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:39:33,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {14573#false} assume !(0 != ~mode3~0 % 256); {14573#false} is VALID [2022-02-20 19:39:33,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {14573#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14573#false} is VALID [2022-02-20 19:39:33,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:39:33,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:39:33,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {14573#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {14573#false} is VALID [2022-02-20 19:39:33,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {14573#false} check_#res#1 := check_~tmp~1#1; {14573#false} is VALID [2022-02-20 19:39:33,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:39:33,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {14573#false} assume 0 == assert_~arg#1 % 256; {14573#false} is VALID [2022-02-20 19:39:33,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {14573#false} assume !false; {14573#false} is VALID [2022-02-20 19:39:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:33,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:33,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911219090] [2022-02-20 19:39:33,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911219090] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:33,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:33,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:33,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918801506] [2022-02-20 19:39:33,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:33,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:39:33,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:33,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:33,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:33,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:33,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:33,283 INFO L87 Difference]: Start difference. First operand 1563 states and 2892 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:35,056 INFO L93 Difference]: Finished difference Result 1629 states and 2994 transitions. [2022-02-20 19:39:35,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:35,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:39:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:35,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:36,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:36,565 INFO L225 Difference]: With dead ends: 1629 [2022-02-20 19:39:36,566 INFO L226 Difference]: Without dead ends: 1593 [2022-02-20 19:39:36,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:36,567 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:39:36,567 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:39:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-02-20 19:39:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1591. [2022-02-20 19:39:36,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:36,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.8477029578351165) internal successors, (2936), 1590 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,596 INFO L74 IsIncluded]: Start isIncluded. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.8477029578351165) internal successors, (2936), 1590 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,598 INFO L87 Difference]: Start difference. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.8477029578351165) internal successors, (2936), 1590 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:36,668 INFO L93 Difference]: Finished difference Result 1593 states and 2937 transitions. [2022-02-20 19:39:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2937 transitions. [2022-02-20 19:39:36,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:36,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:36,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 1591 states, 1589 states have (on average 1.8477029578351165) internal successors, (2936), 1590 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1593 states. [2022-02-20 19:39:36,674 INFO L87 Difference]: Start difference. First operand has 1591 states, 1589 states have (on average 1.8477029578351165) internal successors, (2936), 1590 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1593 states. [2022-02-20 19:39:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:36,743 INFO L93 Difference]: Finished difference Result 1593 states and 2937 transitions. [2022-02-20 19:39:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2937 transitions. [2022-02-20 19:39:36,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:36,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:36,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:36,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1589 states have (on average 1.8477029578351165) internal successors, (2936), 1590 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2936 transitions. [2022-02-20 19:39:36,822 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2936 transitions. Word has length 41 [2022-02-20 19:39:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:36,823 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2936 transitions. [2022-02-20 19:39:36,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2936 transitions. [2022-02-20 19:39:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:36,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:36,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:36,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:39:36,826 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027727, now seen corresponding path program 1 times [2022-02-20 19:39:36,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:36,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600356828] [2022-02-20 19:39:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:36,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {21035#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {21035#true} is VALID [2022-02-20 19:39:36,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {21035#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {21035#true} is VALID [2022-02-20 19:39:36,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {21035#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21035#true} is VALID [2022-02-20 19:39:36,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {21035#true} assume 0 == ~r1~0; {21035#true} is VALID [2022-02-20 19:39:36,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {21035#true} assume ~id1~0 >= 0; {21035#true} is VALID [2022-02-20 19:39:36,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {21035#true} assume 0 == ~st1~0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:36,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {21037#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:36,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {21037#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:36,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {21037#(<= ~st1~0 0)} assume ~id2~0 >= 0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:36,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {21037#(<= ~st1~0 0)} assume 0 == ~st2~0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:36,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {21036#false} is VALID [2022-02-20 19:39:36,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {21036#false} check_#res#1 := check_~tmp~1#1; {21036#false} is VALID [2022-02-20 19:39:36,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {21036#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; {21036#false} is VALID [2022-02-20 19:39:36,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {21036#false} assume 0 == assert_~arg#1 % 256; {21036#false} is VALID [2022-02-20 19:39:36,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {21036#false} assume !false; {21036#false} is VALID [2022-02-20 19:39:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:36,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:36,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600356828] [2022-02-20 19:39:36,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600356828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:36,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:36,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:36,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419662025] [2022-02-20 19:39:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:36,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:39:36,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:36,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:36,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:36,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:36,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:36,952 INFO L87 Difference]: Start difference. First operand 1591 states and 2936 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:39,262 INFO L93 Difference]: Finished difference Result 1975 states and 3536 transitions. [2022-02-20 19:39:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:39:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:39:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:39,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1853 transitions. [2022-02-20 19:39:40,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1853 edges. 1853 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:40,882 INFO L225 Difference]: With dead ends: 1975 [2022-02-20 19:39:40,883 INFO L226 Difference]: Without dead ends: 1911 [2022-02-20 19:39:40,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:39:40,885 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 4709 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4709 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:40,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4709 Valid, 1779 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-02-20 19:39:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1653. [2022-02-20 19:39:40,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:40,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.8358570563294974) internal successors, (3031), 1652 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:40,959 INFO L74 IsIncluded]: Start isIncluded. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.8358570563294974) internal successors, (3031), 1652 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:40,961 INFO L87 Difference]: Start difference. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.8358570563294974) internal successors, (3031), 1652 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:41,064 INFO L93 Difference]: Finished difference Result 1911 states and 3424 transitions. [2022-02-20 19:39:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3424 transitions. [2022-02-20 19:39:41,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:41,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:41,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 1653 states, 1651 states have (on average 1.8358570563294974) internal successors, (3031), 1652 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1911 states. [2022-02-20 19:39:41,071 INFO L87 Difference]: Start difference. First operand has 1653 states, 1651 states have (on average 1.8358570563294974) internal successors, (3031), 1652 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1911 states. [2022-02-20 19:39:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:41,169 INFO L93 Difference]: Finished difference Result 1911 states and 3424 transitions. [2022-02-20 19:39:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3424 transitions. [2022-02-20 19:39:41,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:41,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:41,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:41,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1651 states have (on average 1.8358570563294974) internal successors, (3031), 1652 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 3031 transitions. [2022-02-20 19:39:41,247 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 3031 transitions. Word has length 41 [2022-02-20 19:39:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:41,248 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 3031 transitions. [2022-02-20 19:39:41,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 3031 transitions. [2022-02-20 19:39:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:41,249 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:41,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:41,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:39:41,250 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1902982177, now seen corresponding path program 1 times [2022-02-20 19:39:41,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:41,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46009847] [2022-02-20 19:39:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:41,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {28629#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {28629#true} is VALID [2022-02-20 19:39:41,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {28629#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {28629#true} is VALID [2022-02-20 19:39:41,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {28629#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28629#true} is VALID [2022-02-20 19:39:41,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {28629#true} assume 0 == ~r1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {28631#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {28631#(<= ~r1~0 0)} assume ~id2~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {28631#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {28631#(<= ~r1~0 0)} assume ~id3~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {28631#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {28631#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {28631#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {28631#(<= ~r1~0 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 == main1_~i2~0#1); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {28631#(<= ~r1~0 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {28631#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {28631#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {28631#(<= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {28631#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {28631#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {28631#(<= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {28631#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {28631#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {28631#(<= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {28631#(<= ~r1~0 0)} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {28631#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:41,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {28631#(<= ~r1~0 0)} assume ~r1~0 >= 3; {28630#false} is VALID [2022-02-20 19:39:41,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {28630#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {28630#false} is VALID [2022-02-20 19:39:41,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {28630#false} check_#res#1 := check_~tmp~1#1; {28630#false} is VALID [2022-02-20 19:39:41,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {28630#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; {28630#false} is VALID [2022-02-20 19:39:41,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {28630#false} assume 0 == assert_~arg#1 % 256; {28630#false} is VALID [2022-02-20 19:39:41,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {28630#false} assume !false; {28630#false} is VALID [2022-02-20 19:39:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:41,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:41,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46009847] [2022-02-20 19:39:41,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46009847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:41,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:41,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:41,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634966620] [2022-02-20 19:39:41,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:41,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:41,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:41,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:39:41,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:41,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:41,325 INFO L87 Difference]: Start difference. First operand 1653 states and 3031 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:42,719 INFO L93 Difference]: Finished difference Result 1840 states and 3318 transitions. [2022-02-20 19:39:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:42,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:42,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1620 transitions. [2022-02-20 19:39:43,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1620 edges. 1620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:43,946 INFO L225 Difference]: With dead ends: 1840 [2022-02-20 19:39:43,946 INFO L226 Difference]: Without dead ends: 1714 [2022-02-20 19:39:43,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:43,947 INFO L933 BasicCegarLoop]: 1514 mSDtfsCounter, 1469 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:43,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1565 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-02-20 19:39:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1712. [2022-02-20 19:39:44,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:44,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.8239766081871345) internal successors, (3119), 1711 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:44,085 INFO L74 IsIncluded]: Start isIncluded. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.8239766081871345) internal successors, (3119), 1711 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:44,086 INFO L87 Difference]: Start difference. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.8239766081871345) internal successors, (3119), 1711 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:44,166 INFO L93 Difference]: Finished difference Result 1714 states and 3120 transitions. [2022-02-20 19:39:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 3120 transitions. [2022-02-20 19:39:44,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:44,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:44,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 1712 states, 1710 states have (on average 1.8239766081871345) internal successors, (3119), 1711 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1714 states. [2022-02-20 19:39:44,172 INFO L87 Difference]: Start difference. First operand has 1712 states, 1710 states have (on average 1.8239766081871345) internal successors, (3119), 1711 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1714 states. [2022-02-20 19:39:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:44,249 INFO L93 Difference]: Finished difference Result 1714 states and 3120 transitions. [2022-02-20 19:39:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 3120 transitions. [2022-02-20 19:39:44,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:44,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:44,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:44,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1710 states have (on average 1.8239766081871345) internal successors, (3119), 1711 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 3119 transitions. [2022-02-20 19:39:44,330 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 3119 transitions. Word has length 43 [2022-02-20 19:39:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:44,332 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 3119 transitions. [2022-02-20 19:39:44,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 3119 transitions. [2022-02-20 19:39:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:44,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:44,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:44,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:39:44,333 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:44,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:44,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488665, now seen corresponding path program 1 times [2022-02-20 19:39:44,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:44,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194723804] [2022-02-20 19:39:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:44,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {35732#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {35732#true} is VALID [2022-02-20 19:39:44,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {35732#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {35732#true} is VALID [2022-02-20 19:39:44,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {35732#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {35732#true} is VALID [2022-02-20 19:39:44,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {35732#true} assume 0 == ~r1~0; {35732#true} is VALID [2022-02-20 19:39:44,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {35732#true} assume ~id1~0 >= 0; {35732#true} is VALID [2022-02-20 19:39:44,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {35732#true} assume 0 == ~st1~0; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:44,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {35734#(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; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:44,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {35734#(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; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:44,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {35734#(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; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:44,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {35734#(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; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:44,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {35735#(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; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:44,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {35735#(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; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:44,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {35735#(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; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:44,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {35735#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main1_~i2~0#1); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {35736#(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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:44,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {35736#(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; {35733#false} is VALID [2022-02-20 19:39:44,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {35733#false} check_#res#1 := check_~tmp~1#1; {35733#false} is VALID [2022-02-20 19:39:44,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {35733#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; {35733#false} is VALID [2022-02-20 19:39:44,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {35733#false} assume 0 == assert_~arg#1 % 256; {35733#false} is VALID [2022-02-20 19:39:44,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {35733#false} assume !false; {35733#false} is VALID [2022-02-20 19:39:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:44,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:44,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194723804] [2022-02-20 19:39:44,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194723804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:44,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:44,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:44,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921589298] [2022-02-20 19:39:44,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:44,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:44,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:44,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:44,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:44,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:44,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:44,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:44,523 INFO L87 Difference]: Start difference. First operand 1712 states and 3119 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:39:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:47,225 INFO L93 Difference]: Finished difference Result 1897 states and 3401 transitions. [2022-02-20 19:39:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:39:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:47,226 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:39:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:39:47,232 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:39:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:39:47,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1627 transitions. [2022-02-20 19:39:48,567 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:39:48,646 INFO L225 Difference]: With dead ends: 1897 [2022-02-20 19:39:48,647 INFO L226 Difference]: Without dead ends: 1714 [2022-02-20 19:39:48,647 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:39:48,648 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 3002 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3002 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:48,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3002 Valid, 1633 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-02-20 19:39:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1712. [2022-02-20 19:39:48,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:48,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.8222222222222222) internal successors, (3116), 1711 states have internal predecessors, (3116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:48,750 INFO L74 IsIncluded]: Start isIncluded. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.8222222222222222) internal successors, (3116), 1711 states have internal predecessors, (3116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:48,751 INFO L87 Difference]: Start difference. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.8222222222222222) internal successors, (3116), 1711 states have internal predecessors, (3116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:48,825 INFO L93 Difference]: Finished difference Result 1714 states and 3117 transitions. [2022-02-20 19:39:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 3117 transitions. [2022-02-20 19:39:48,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:48,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:48,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 1712 states, 1710 states have (on average 1.8222222222222222) internal successors, (3116), 1711 states have internal predecessors, (3116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1714 states. [2022-02-20 19:39:48,830 INFO L87 Difference]: Start difference. First operand has 1712 states, 1710 states have (on average 1.8222222222222222) internal successors, (3116), 1711 states have internal predecessors, (3116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1714 states. [2022-02-20 19:39:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:48,904 INFO L93 Difference]: Finished difference Result 1714 states and 3117 transitions. [2022-02-20 19:39:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 3117 transitions. [2022-02-20 19:39:48,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:48,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:48,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:48,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1710 states have (on average 1.8222222222222222) internal successors, (3116), 1711 states have internal predecessors, (3116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 3116 transitions. [2022-02-20 19:39:48,984 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 3116 transitions. Word has length 43 [2022-02-20 19:39:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:48,984 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 3116 transitions. [2022-02-20 19:39:48,984 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:39:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 3116 transitions. [2022-02-20 19:39:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:48,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:48,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:48,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:39:48,986 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash -47574589, now seen corresponding path program 1 times [2022-02-20 19:39:48,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:48,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455796799] [2022-02-20 19:39:48,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:48,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:49,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {42907#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {42907#true} is VALID [2022-02-20 19:39:49,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {42907#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {42907#true} is VALID [2022-02-20 19:39:49,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {42907#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {42907#true} is VALID [2022-02-20 19:39:49,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {42907#true} assume 0 == ~r1~0; {42907#true} is VALID [2022-02-20 19:39:49,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {42907#true} assume ~id1~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:49,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {42907#true} assume 0 == ~st1~0; {42907#true} is VALID [2022-02-20 19:39:49,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {42907#true} assume ~send1~0 == ~id1~0; {42907#true} is VALID [2022-02-20 19:39:49,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {42907#true} assume 0 == ~mode1~0 % 256; {42907#true} is VALID [2022-02-20 19:39:49,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {42907#true} assume ~id2~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:49,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {42907#true} assume 0 == ~st2~0; {42907#true} is VALID [2022-02-20 19:39:49,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {42907#true} assume ~send2~0 == ~id2~0; {42907#true} is VALID [2022-02-20 19:39:49,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {42907#true} assume 0 == ~mode2~0 % 256; {42907#true} is VALID [2022-02-20 19:39:49,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {42907#true} assume ~id3~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:49,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {42907#true} assume 0 == ~st3~0; {42907#true} is VALID [2022-02-20 19:39:49,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {42907#true} assume ~send3~0 == ~id3~0; {42907#true} is VALID [2022-02-20 19:39:49,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {42907#true} assume 0 == ~mode3~0 % 256; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:49,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {42909#(= (+ (* (- 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; {42908#false} is VALID [2022-02-20 19:39:49,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {42908#false} assume node3_~m3~0#1 != ~nomsg~0; {42908#false} is VALID [2022-02-20 19:39:49,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {42908#false} assume !(node3_~m3~0#1 > ~id3~0); {42908#false} is VALID [2022-02-20 19:39:49,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {42908#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {42908#false} is VALID [2022-02-20 19:39:49,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {42908#false} ~mode3~0 := 0; {42908#false} is VALID [2022-02-20 19:39:49,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {42908#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; {42908#false} is VALID [2022-02-20 19:39:49,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {42908#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {42908#false} is VALID [2022-02-20 19:39:49,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {42908#false} check_#res#1 := check_~tmp~1#1; {42908#false} is VALID [2022-02-20 19:39:49,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {42908#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; {42908#false} is VALID [2022-02-20 19:39:49,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {42908#false} assume 0 == assert_~arg#1 % 256; {42908#false} is VALID [2022-02-20 19:39:49,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {42908#false} assume !false; {42908#false} is VALID [2022-02-20 19:39:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:49,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:49,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455796799] [2022-02-20 19:39:49,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455796799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:49,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:49,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:49,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187897554] [2022-02-20 19:39:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:49,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:49,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:49,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:49,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:49,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:49,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:49,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:49,059 INFO L87 Difference]: Start difference. First operand 1712 states and 3116 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:50,872 INFO L93 Difference]: Finished difference Result 2042 states and 3612 transitions. [2022-02-20 19:39:50,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:50,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:50,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:52,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:52,391 INFO L225 Difference]: With dead ends: 2042 [2022-02-20 19:39:52,391 INFO L226 Difference]: Without dead ends: 1859 [2022-02-20 19:39:52,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:39:52,393 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:39:52,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:39:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-02-20 19:39:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1857. [2022-02-20 19:39:52,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:52,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.7935309973045823) internal successors, (3327), 1856 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:52,571 INFO L74 IsIncluded]: Start isIncluded. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.7935309973045823) internal successors, (3327), 1856 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:52,572 INFO L87 Difference]: Start difference. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.7935309973045823) internal successors, (3327), 1856 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:52,657 INFO L93 Difference]: Finished difference Result 1859 states and 3328 transitions. [2022-02-20 19:39:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3328 transitions. [2022-02-20 19:39:52,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:52,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:52,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 1857 states, 1855 states have (on average 1.7935309973045823) internal successors, (3327), 1856 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1859 states. [2022-02-20 19:39:52,662 INFO L87 Difference]: Start difference. First operand has 1857 states, 1855 states have (on average 1.7935309973045823) internal successors, (3327), 1856 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1859 states. [2022-02-20 19:39:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:52,747 INFO L93 Difference]: Finished difference Result 1859 states and 3328 transitions. [2022-02-20 19:39:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3328 transitions. [2022-02-20 19:39:52,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:52,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:52,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:52,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1855 states have (on average 1.7935309973045823) internal successors, (3327), 1856 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 3327 transitions. [2022-02-20 19:39:52,845 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 3327 transitions. Word has length 43 [2022-02-20 19:39:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:52,845 INFO L470 AbstractCegarLoop]: Abstraction has 1857 states and 3327 transitions. [2022-02-20 19:39:52,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 3327 transitions. [2022-02-20 19:39:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:52,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:52,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:52,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:39:52,847 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1199933027, now seen corresponding path program 1 times [2022-02-20 19:39:52,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:52,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89583465] [2022-02-20 19:39:52,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:52,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {50728#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {50728#true} is VALID [2022-02-20 19:39:52,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {50728#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {50728#true} is VALID [2022-02-20 19:39:52,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {50728#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {50728#true} is VALID [2022-02-20 19:39:52,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {50728#true} assume 0 == ~r1~0; {50728#true} is VALID [2022-02-20 19:39:52,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {50728#true} assume ~id1~0 >= 0; {50728#true} is VALID [2022-02-20 19:39:52,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {50728#true} assume 0 == ~st1~0; {50728#true} is VALID [2022-02-20 19:39:52,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {50728#true} assume ~send1~0 == ~id1~0; {50728#true} is VALID [2022-02-20 19:39:52,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {50728#true} assume 0 == ~mode1~0 % 256; {50728#true} is VALID [2022-02-20 19:39:52,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {50728#true} assume ~id2~0 >= 0; {50728#true} is VALID [2022-02-20 19:39:52,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {50728#true} assume 0 == ~st2~0; {50728#true} is VALID [2022-02-20 19:39:52,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {50728#true} assume ~send2~0 == ~id2~0; {50728#true} is VALID [2022-02-20 19:39:52,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {50728#true} assume 0 == ~mode2~0 % 256; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {50730#(= (+ (* (- 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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {50730#(= (+ (* (- 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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {50730#(= (+ (* (- 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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:52,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {50730#(= (+ (* (- 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; {50729#false} is VALID [2022-02-20 19:39:52,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {50729#false} assume node2_~m2~0#1 != ~nomsg~0; {50729#false} is VALID [2022-02-20 19:39:52,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {50729#false} assume !(node2_~m2~0#1 > ~id2~0); {50729#false} is VALID [2022-02-20 19:39:52,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {50729#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {50729#false} is VALID [2022-02-20 19:39:52,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {50729#false} ~mode2~0 := 0; {50729#false} is VALID [2022-02-20 19:39:52,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {50729#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; {50729#false} is VALID [2022-02-20 19:39:52,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {50729#false} assume !(0 != ~mode3~0 % 256); {50729#false} is VALID [2022-02-20 19:39:52,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {50729#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {50729#false} is VALID [2022-02-20 19:39:52,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {50729#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; {50729#false} is VALID [2022-02-20 19:39:52,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {50729#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; {50729#false} is VALID [2022-02-20 19:39:52,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {50729#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {50729#false} is VALID [2022-02-20 19:39:52,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {50729#false} check_#res#1 := check_~tmp~1#1; {50729#false} is VALID [2022-02-20 19:39:52,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {50729#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; {50729#false} is VALID [2022-02-20 19:39:52,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {50729#false} assume 0 == assert_~arg#1 % 256; {50729#false} is VALID [2022-02-20 19:39:52,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {50729#false} assume !false; {50729#false} is VALID [2022-02-20 19:39:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:52,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:52,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89583465] [2022-02-20 19:39:52,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89583465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:52,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:52,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:52,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104593856] [2022-02-20 19:39:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:52,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:52,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:52,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:52,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:52,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:52,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:52,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:52,955 INFO L87 Difference]: Start difference. First operand 1857 states and 3327 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:55,036 INFO L93 Difference]: Finished difference Result 2441 states and 4185 transitions. [2022-02-20 19:39:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:55,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:39:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:55,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:56,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:56,540 INFO L225 Difference]: With dead ends: 2441 [2022-02-20 19:39:56,541 INFO L226 Difference]: Without dead ends: 2113 [2022-02-20 19:39:56,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:56,542 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:39:56,542 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:39:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-02-20 19:39:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2022-02-20 19:39:56,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:56,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.746325272641062) internal successors, (3683), 2110 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:56,873 INFO L74 IsIncluded]: Start isIncluded. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.746325272641062) internal successors, (3683), 2110 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:56,874 INFO L87 Difference]: Start difference. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.746325272641062) internal successors, (3683), 2110 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:56,981 INFO L93 Difference]: Finished difference Result 2113 states and 3684 transitions. [2022-02-20 19:39:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3684 transitions. [2022-02-20 19:39:56,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:56,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:56,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 2111 states, 2109 states have (on average 1.746325272641062) internal successors, (3683), 2110 states have internal predecessors, (3683), 0 states have call successors, (0), 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 2113 states. [2022-02-20 19:39:56,987 INFO L87 Difference]: Start difference. First operand has 2111 states, 2109 states have (on average 1.746325272641062) internal successors, (3683), 2110 states have internal predecessors, (3683), 0 states have call successors, (0), 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 2113 states. [2022-02-20 19:39:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:57,103 INFO L93 Difference]: Finished difference Result 2113 states and 3684 transitions. [2022-02-20 19:39:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3684 transitions. [2022-02-20 19:39:57,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:57,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:57,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:57,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 2109 states have (on average 1.746325272641062) internal successors, (3683), 2110 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3683 transitions. [2022-02-20 19:39:57,225 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3683 transitions. Word has length 43 [2022-02-20 19:39:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:57,225 INFO L470 AbstractCegarLoop]: Abstraction has 2111 states and 3683 transitions. [2022-02-20 19:39:57,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:39:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3683 transitions. [2022-02-20 19:39:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:39:57,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:57,226 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:39:57,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:39:57,226 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1511296967, now seen corresponding path program 1 times [2022-02-20 19:39:57,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:57,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982441666] [2022-02-20 19:39:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:57,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {59885#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {59885#true} is VALID [2022-02-20 19:39:57,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {59885#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {59885#true} is VALID [2022-02-20 19:39:57,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {59885#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {59885#true} is VALID [2022-02-20 19:39:57,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {59885#true} assume 0 == ~r1~0; {59885#true} is VALID [2022-02-20 19:39:57,297 INFO L290 TraceCheckUtils]: 4: Hoare triple {59885#true} assume ~id1~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:57,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {59885#true} assume 0 == ~st1~0; {59885#true} is VALID [2022-02-20 19:39:57,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {59885#true} assume ~send1~0 == ~id1~0; {59885#true} is VALID [2022-02-20 19:39:57,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {59885#true} assume 0 == ~mode1~0 % 256; {59885#true} is VALID [2022-02-20 19:39:57,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {59885#true} assume ~id2~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:57,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {59885#true} assume 0 == ~st2~0; {59885#true} is VALID [2022-02-20 19:39:57,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {59885#true} assume ~send2~0 == ~id2~0; {59885#true} is VALID [2022-02-20 19:39:57,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {59885#true} assume 0 == ~mode2~0 % 256; {59885#true} is VALID [2022-02-20 19:39:57,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {59885#true} assume ~id3~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:57,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {59885#true} assume 0 == ~st3~0; {59885#true} is VALID [2022-02-20 19:39:57,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {59885#true} assume ~send3~0 == ~id3~0; {59885#true} is VALID [2022-02-20 19:39:57,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {59885#true} assume 0 == ~mode3~0 % 256; {59885#true} is VALID [2022-02-20 19:39:57,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {59885#true} assume ~id1~0 != ~id2~0; {59885#true} is VALID [2022-02-20 19:39:57,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {59885#true} assume ~id1~0 != ~id3~0; {59885#true} is VALID [2022-02-20 19:39:57,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {59885#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {59887#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:39:57,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {59887#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {59888#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:39:57,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {59888#(= |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; {59889#(= |ULTIMATE.start_main1_~i2~0#1| 1)} is VALID [2022-02-20 19:39:57,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {59889#(= |ULTIMATE.start_main1_~i2~0#1| 1)} assume !(0 == main1_~i2~0#1); {59885#true} is VALID [2022-02-20 19:39:57,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {59885#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; {59885#true} is VALID [2022-02-20 19:39:57,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {59885#true} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {59885#true} is VALID [2022-02-20 19:39:57,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {59885#true} assume !(0 != ~mode1~0 % 256); {59885#true} is VALID [2022-02-20 19:39:57,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {59885#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {59885#true} is VALID [2022-02-20 19:39:57,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {59885#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; {59885#true} is VALID [2022-02-20 19:39:57,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {59885#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; {59885#true} is VALID [2022-02-20 19:39:57,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {59885#true} assume !(0 != ~mode2~0 % 256); {59885#true} is VALID [2022-02-20 19:39:57,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {59885#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {59885#true} is VALID [2022-02-20 19:39:57,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {59885#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; {59885#true} is VALID [2022-02-20 19:39:57,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {59885#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; {59885#true} is VALID [2022-02-20 19:39:57,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {59885#true} assume !(0 != ~mode3~0 % 256); {59885#true} is VALID [2022-02-20 19:39:57,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {59885#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {59885#true} is VALID [2022-02-20 19:39:57,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {59885#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; {59885#true} is VALID [2022-02-20 19:39:57,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {59885#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; {59885#true} is VALID [2022-02-20 19:39:57,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {59885#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {59885#true} is VALID [2022-02-20 19:39:57,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {59885#true} assume !(~r1~0 >= 3); {59885#true} is VALID [2022-02-20 19:39:57,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {59885#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {59885#true} is VALID [2022-02-20 19:39:57,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {59885#true} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {59890#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:39:57,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {59890#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {59891#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:39:57,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {59891#(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; {59892#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:39:57,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {59892#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {59886#false} is VALID [2022-02-20 19:39:57,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {59886#false} assume !false; {59886#false} is VALID [2022-02-20 19:39:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:57,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:57,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982441666] [2022-02-20 19:39:57,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982441666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:57,305 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:57,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:39:57,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144133793] [2022-02-20 19:39:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:57,306 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:39:57,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:57,306 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:39:57,330 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:39:57,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:39:57,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:57,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:39:57,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:39:57,331 INFO L87 Difference]: Start difference. First operand 2111 states and 3683 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:40:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:04,520 INFO L93 Difference]: Finished difference Result 2634 states and 4411 transitions. [2022-02-20 19:40:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:40:04,520 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:40:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:04,521 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:40:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:40:04,526 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:40:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:40:04,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1577 transitions. [2022-02-20 19:40:05,673 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:40:05,902 INFO L225 Difference]: With dead ends: 2634 [2022-02-20 19:40:05,902 INFO L226 Difference]: Without dead ends: 2632 [2022-02-20 19:40:05,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:40:05,904 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 331 mSDsluCounter, 8972 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 10503 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:05,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 10503 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2022-02-20 19:40:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2159. [2022-02-20 19:40:06,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:06,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2632 states. Second operand has 2159 states, 2157 states have (on average 1.727862772369031) internal successors, (3727), 2158 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call 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:06,427 INFO L74 IsIncluded]: Start isIncluded. First operand 2632 states. Second operand has 2159 states, 2157 states have (on average 1.727862772369031) internal successors, (3727), 2158 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call 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:06,429 INFO L87 Difference]: Start difference. First operand 2632 states. Second operand has 2159 states, 2157 states have (on average 1.727862772369031) internal successors, (3727), 2158 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call 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:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:06,592 INFO L93 Difference]: Finished difference Result 2632 states and 4390 transitions. [2022-02-20 19:40:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4390 transitions. [2022-02-20 19:40:06,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:06,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:06,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 2159 states, 2157 states have (on average 1.727862772369031) internal successors, (3727), 2158 states have internal predecessors, (3727), 0 states have call successors, (0), 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 2632 states. [2022-02-20 19:40:06,598 INFO L87 Difference]: Start difference. First operand has 2159 states, 2157 states have (on average 1.727862772369031) internal successors, (3727), 2158 states have internal predecessors, (3727), 0 states have call successors, (0), 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 2632 states. [2022-02-20 19:40:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:06,767 INFO L93 Difference]: Finished difference Result 2632 states and 4390 transitions. [2022-02-20 19:40:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4390 transitions. [2022-02-20 19:40:06,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:06,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:06,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:06,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 2157 states have (on average 1.727862772369031) internal successors, (3727), 2158 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call 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:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3727 transitions. [2022-02-20 19:40:06,901 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3727 transitions. Word has length 44 [2022-02-20 19:40:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:06,901 INFO L470 AbstractCegarLoop]: Abstraction has 2159 states and 3727 transitions. [2022-02-20 19:40:06,901 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:40:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3727 transitions. [2022-02-20 19:40:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:06,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:06,902 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:40:06,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:40:06,903 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -213997176, now seen corresponding path program 1 times [2022-02-20 19:40:06,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:06,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260797272] [2022-02-20 19:40:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:07,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {70437#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {70437#true} is VALID [2022-02-20 19:40:07,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {70437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {70437#true} is VALID [2022-02-20 19:40:07,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {70437#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {70437#true} is VALID [2022-02-20 19:40:07,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {70437#true} assume 0 == ~r1~0; {70437#true} is VALID [2022-02-20 19:40:07,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {70437#true} assume ~id1~0 >= 0; {70437#true} is VALID [2022-02-20 19:40:07,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {70437#true} assume 0 == ~st1~0; {70439#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:07,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {70439#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {70439#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:07,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {70439#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {70439#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:07,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {70439#(<= ~st1~0 0)} assume ~id2~0 >= 0; {70439#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:07,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {70439#(<= ~st1~0 0)} assume 0 == ~st2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true;main1_#t~post23#1 := main1_~i2~0#1;main1_~i2~0#1 := 1 + main1_#t~post23#1;havoc main1_#t~post23#1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,020 INFO L290 TraceCheckUtils]: 50: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {70440#(<= (+ ~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,022 INFO L290 TraceCheckUtils]: 55: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:07,022 INFO L290 TraceCheckUtils]: 56: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:07,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:07,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {70441#(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; {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:07,023 INFO L290 TraceCheckUtils]: 59: Hoare triple {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {70438#false} is VALID [2022-02-20 19:40:07,023 INFO L290 TraceCheckUtils]: 60: Hoare triple {70438#false} check_#res#1 := check_~tmp~1#1; {70438#false} is VALID [2022-02-20 19:40:07,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {70438#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; {70438#false} is VALID [2022-02-20 19:40:07,024 INFO L290 TraceCheckUtils]: 62: Hoare triple {70438#false} assume 0 == assert_~arg#1 % 256; {70438#false} is VALID [2022-02-20 19:40:07,024 INFO L290 TraceCheckUtils]: 63: Hoare triple {70438#false} assume !false; {70438#false} is VALID [2022-02-20 19:40:07,024 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:40:07,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:07,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260797272] [2022-02-20 19:40:07,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260797272] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:07,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:07,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:07,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414914934] [2022-02-20 19:40:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:07,025 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:40:07,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:07,026 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:40:07,063 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:40:07,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:07,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:07,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:07,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:07,064 INFO L87 Difference]: Start difference. First operand 2159 states and 3727 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) [2022-02-20 19:40:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:11,566 INFO L93 Difference]: Finished difference Result 4187 states and 6575 transitions. [2022-02-20 19:40:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:11,567 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:40:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:40:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1738 transitions. [2022-02-20 19:40:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:40:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1738 transitions. [2022-02-20 19:40:11,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1738 transitions. [2022-02-20 19:40:12,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1738 edges. 1738 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:13,373 INFO L225 Difference]: With dead ends: 4187 [2022-02-20 19:40:13,373 INFO L226 Difference]: Without dead ends: 3557 [2022-02-20 19:40:13,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:40:13,375 INFO L933 BasicCegarLoop]: 1563 mSDtfsCounter, 3075 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3075 SdHoareTripleChecker+Valid, 3177 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:13,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3075 Valid, 3177 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-02-20 19:40:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 2787. [2022-02-20 19:40:14,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:14,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3557 states. Second operand has 2787 states, 2785 states have (on average 1.6527827648114901) internal successors, (4603), 2786 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call 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:14,110 INFO L74 IsIncluded]: Start isIncluded. First operand 3557 states. Second operand has 2787 states, 2785 states have (on average 1.6527827648114901) internal successors, (4603), 2786 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call 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:14,112 INFO L87 Difference]: Start difference. First operand 3557 states. Second operand has 2787 states, 2785 states have (on average 1.6527827648114901) internal successors, (4603), 2786 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call 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:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:14,437 INFO L93 Difference]: Finished difference Result 3557 states and 5674 transitions. [2022-02-20 19:40:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5674 transitions. [2022-02-20 19:40:14,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:14,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:14,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 2787 states, 2785 states have (on average 1.6527827648114901) internal successors, (4603), 2786 states have internal predecessors, (4603), 0 states have call successors, (0), 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 3557 states. [2022-02-20 19:40:14,445 INFO L87 Difference]: Start difference. First operand has 2787 states, 2785 states have (on average 1.6527827648114901) internal successors, (4603), 2786 states have internal predecessors, (4603), 0 states have call successors, (0), 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 3557 states. [2022-02-20 19:40:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:14,773 INFO L93 Difference]: Finished difference Result 3557 states and 5674 transitions. [2022-02-20 19:40:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5674 transitions. [2022-02-20 19:40:14,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:14,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:14,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:14,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2785 states have (on average 1.6527827648114901) internal successors, (4603), 2786 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call 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:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 4603 transitions. [2022-02-20 19:40:15,000 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 4603 transitions. Word has length 64 [2022-02-20 19:40:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:15,000 INFO L470 AbstractCegarLoop]: Abstraction has 2787 states and 4603 transitions. [2022-02-20 19:40:15,000 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 19:40:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 4603 transitions. [2022-02-20 19:40:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:15,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:15,001 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:40:15,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:40:15,002 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1033510440, now seen corresponding path program 1 times [2022-02-20 19:40:15,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:15,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950747718] [2022-02-20 19:40:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:15,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {85533#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {85533#true} is VALID [2022-02-20 19:40:15,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {85533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {85533#true} is VALID [2022-02-20 19:40:15,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {85533#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {85533#true} is VALID [2022-02-20 19:40:15,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {85533#true} assume 0 == ~r1~0; {85533#true} is VALID [2022-02-20 19:40:15,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {85533#true} assume ~id1~0 >= 0; {85533#true} is VALID [2022-02-20 19:40:15,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {85533#true} assume 0 == ~st1~0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:15,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {85535#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:15,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {85535#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:15,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {85535#(<= ~st1~0 0)} assume ~id2~0 >= 0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:15,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {85535#(<= ~st1~0 0)} assume 0 == ~st2~0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:15,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {85535#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:15,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {85535#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:15,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {85535#(<= ~st1~0 0)} assume ~id3~0 >= 0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:15,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {85535#(<= ~st1~0 0)} assume 0 == ~st3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true;main1_#t~post23#1 := main1_~i2~0#1;main1_~i2~0#1 := 1 + main1_#t~post23#1;havoc main1_#t~post23#1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {85536#(<= (+ ~st3~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:15,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:15,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:15,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:15,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 != ~mode3~0 % 256); {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:15,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:15,088 INFO L290 TraceCheckUtils]: 57: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:15,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:15,089 INFO L290 TraceCheckUtils]: 59: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {85534#false} is VALID [2022-02-20 19:40:15,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {85534#false} check_#res#1 := check_~tmp~1#1; {85534#false} is VALID [2022-02-20 19:40:15,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {85534#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; {85534#false} is VALID [2022-02-20 19:40:15,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {85534#false} assume 0 == assert_~arg#1 % 256; {85534#false} is VALID [2022-02-20 19:40:15,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {85534#false} assume !false; {85534#false} is VALID [2022-02-20 19:40:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 19:40:15,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:15,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950747718] [2022-02-20 19:40:15,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950747718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:15,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:15,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:15,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829496480] [2022-02-20 19:40:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:15,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:40:15,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:15,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call 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:15,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:15,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:15,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:15,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:15,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:15,123 INFO L87 Difference]: Start difference. First operand 2787 states and 4603 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)