./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.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.UNBOUNDED.pals+Problem12_label09.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 00613173bfd5be4a2d23c5cbdde33ad3a2bf8c778a3dcd5e833889c0a53ce55c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:40:06,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:40:06,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:40:06,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:40:06,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:40:06,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:40:06,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:40:06,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:40:06,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:40:06,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:40:06,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:40:06,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:40:06,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:40:06,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:40:06,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:40:06,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:40:06,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:40:06,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:40:06,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:40:06,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:40:06,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:40:06,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:40:06,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:40:06,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:40:06,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:40:06,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:40:06,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:40:06,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:40:06,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:40:06,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:40:06,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:40:06,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:40:06,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:40:06,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:40:06,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:40:06,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:40:06,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:40:06,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:40:06,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:40:06,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:40:06,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:40:06,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:40:06,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:40:06,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:40:06,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:40:06,906 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:40:06,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:40:06,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:40:06,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:40:06,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:40:06,907 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:40:06,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:40:06,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:40:06,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:40:06,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:40:06,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:40:06,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:40:06,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:40:06,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:40:06,909 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:40:06,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:40:06,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:40:06,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:40:06,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:40:06,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:40:06,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:40:06,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:40:06,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:40:06,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:40:06,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:40:06,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:40:06,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:40:06,911 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:40:06,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:40:06,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:40:06,911 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 -> 00613173bfd5be4a2d23c5cbdde33ad3a2bf8c778a3dcd5e833889c0a53ce55c [2022-02-20 19:40:07,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:40:07,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:40:07,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:40:07,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:40:07,119 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:40:07,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:40:07,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642002b69/df46bbea81aa41dea374bc0d10879ade/FLAG0004e2049 [2022-02-20 19:40:07,731 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:40:07,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:40:07,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642002b69/df46bbea81aa41dea374bc0d10879ade/FLAG0004e2049 [2022-02-20 19:40:08,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642002b69/df46bbea81aa41dea374bc0d10879ade [2022-02-20 19:40:08,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:40:08,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:40:08,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:08,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:40:08,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:40:08,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:08" (1/1) ... [2022-02-20 19:40:08,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d592dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:08, skipping insertion in model container [2022-02-20 19:40:08,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:08" (1/1) ... [2022-02-20 19:40:08,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:40:08,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:40:08,474 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.UNBOUNDED.pals+Problem12_label09.c[6450,6463] [2022-02-20 19:40:08,513 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.UNBOUNDED.pals+Problem12_label09.c[14198,14211] [2022-02-20 19:40:08,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:08,975 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:40:09,004 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.UNBOUNDED.pals+Problem12_label09.c[6450,6463] [2022-02-20 19:40:09,015 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.UNBOUNDED.pals+Problem12_label09.c[14198,14211] [2022-02-20 19:40:09,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:09,297 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:40:09,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09 WrapperNode [2022-02-20 19:40:09,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:09,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:09,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:40:09,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:40:09,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,645 INFO L137 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4976 [2022-02-20 19:40:09,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:09,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:40:09,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:40:09,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:40:09,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:40:09,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:40:09,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:40:09,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:40:09,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (1/1) ... [2022-02-20 19:40:09,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:40:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:40:10,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:40:10,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:40:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:40:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:40:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:40:10,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:40:10,165 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:40:10,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:40:16,411 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:40:16,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:40:16,428 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:40:16,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:16 BoogieIcfgContainer [2022-02-20 19:40:16,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:40:16,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:40:16,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:40:16,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:40:16,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:40:08" (1/3) ... [2022-02-20 19:40:16,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30333021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:16, skipping insertion in model container [2022-02-20 19:40:16,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:09" (2/3) ... [2022-02-20 19:40:16,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30333021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:16, skipping insertion in model container [2022-02-20 19:40:16,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:16" (3/3) ... [2022-02-20 19:40:16,437 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:40:16,442 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:40:16,443 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:40:16,489 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:40:16,503 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:40:16,503 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:40:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 880 states, 877 states have (on average 1.903078677309008) internal successors, (1669), 879 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call 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:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:16,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:16,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:16,544 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1601385972, now seen corresponding path program 1 times [2022-02-20 19:40:16,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:16,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380899864] [2022-02-20 19:40:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:16,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:16,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {883#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#true} is VALID [2022-02-20 19:40:16,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {883#true} is VALID [2022-02-20 19:40:16,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {883#true} is VALID [2022-02-20 19:40:16,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {883#true} is VALID [2022-02-20 19:40:16,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {883#true} init_#res#1 := init_~tmp~0#1; {883#true} is VALID [2022-02-20 19:40:16,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#true} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {883#true} is VALID [2022-02-20 19:40:16,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {884#false} is VALID [2022-02-20 19:40:16,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {884#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {884#false} is VALID [2022-02-20 19:40:16,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {884#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {884#false} is VALID [2022-02-20 19:40:16,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#false} assume !(0 != ~mode1~0 % 256); {884#false} is VALID [2022-02-20 19:40:16,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {884#false} is VALID [2022-02-20 19:40:16,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {884#false} is VALID [2022-02-20 19:40:16,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:40:16,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {884#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {884#false} is VALID [2022-02-20 19:40:16,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {884#false} assume !(node2_~m2~0#1 != ~nomsg~0); {884#false} is VALID [2022-02-20 19:40:16,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {884#false} ~mode2~0 := 0; {884#false} is VALID [2022-02-20 19:40:16,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:40:16,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {884#false} is VALID [2022-02-20 19:40:16,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !(node3_~m3~0#1 != ~nomsg~0); {884#false} is VALID [2022-02-20 19:40:16,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {884#false} ~mode3~0 := 0; {884#false} is VALID [2022-02-20 19:40:16,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:40:16,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {884#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {884#false} is VALID [2022-02-20 19:40:16,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {884#false} check_#res#1 := check_~tmp~1#1; {884#false} is VALID [2022-02-20 19:40:16,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:40:16,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {884#false} assume 0 == assert_~arg#1 % 256; {884#false} is VALID [2022-02-20 19:40:16,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-02-20 19:40:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:16,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:16,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380899864] [2022-02-20 19:40:16,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380899864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:16,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:16,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:40:16,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565142085] [2022-02-20 19:40:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:16,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:40:16,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:16,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:16,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:16,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:40:16,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:40:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:40:16,805 INFO L87 Difference]: Start difference. First operand has 880 states, 877 states have (on average 1.903078677309008) internal successors, (1669), 879 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:18,085 INFO L93 Difference]: Finished difference Result 1736 states and 3296 transitions. [2022-02-20 19:40:18,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:40:18,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:40:18,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3296 transitions. [2022-02-20 19:40:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3296 transitions. [2022-02-20 19:40:18,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3296 transitions. [2022-02-20 19:40:20,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3296 edges. 3296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:20,617 INFO L225 Difference]: With dead ends: 1736 [2022-02-20 19:40:20,617 INFO L226 Difference]: Without dead ends: 814 [2022-02-20 19:40:20,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:40:20,627 INFO L933 BasicCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:20,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-02-20 19:40:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2022-02-20 19:40:20,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:20,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call 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:20,688 INFO L74 IsIncluded]: Start isIncluded. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call 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:20,689 INFO L87 Difference]: Start difference. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call 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:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:20,722 INFO L93 Difference]: Finished difference Result 814 states and 1536 transitions. [2022-02-20 19:40:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:40:20,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:20,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:20,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:20,736 INFO L87 Difference]: Start difference. First operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:20,763 INFO L93 Difference]: Finished difference Result 814 states and 1536 transitions. [2022-02-20 19:40:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:40:20,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:20,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:20,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:20,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call 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:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1536 transitions. [2022-02-20 19:40:20,797 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1536 transitions. Word has length 26 [2022-02-20 19:40:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:20,798 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1536 transitions. [2022-02-20 19:40:20,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:40:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:20,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:20,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:20,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:40:20,804 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:20,805 INFO L85 PathProgramCache]: Analyzing trace with hash 783737522, now seen corresponding path program 1 times [2022-02-20 19:40:20,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:20,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844578295] [2022-02-20 19:40:20,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:20,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:20,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {5103#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; {5103#true} is VALID [2022-02-20 19:40:20,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {5103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {5103#true} is VALID [2022-02-20 19:40:20,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {5103#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5103#true} is VALID [2022-02-20 19:40:20,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {5103#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5105#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:40:20,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {5105#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5106#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:40:20,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {5106#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5107#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:40:20,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {5107#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5104#false} is VALID [2022-02-20 19:40:20,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {5104#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5104#false} is VALID [2022-02-20 19:40:20,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {5104#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5104#false} is VALID [2022-02-20 19:40:20,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#false} assume !(0 != ~mode1~0 % 256); {5104#false} is VALID [2022-02-20 19:40:20,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5104#false} is VALID [2022-02-20 19:40:20,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {5104#false} is VALID [2022-02-20 19:40:20,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:40:20,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {5104#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5104#false} is VALID [2022-02-20 19:40:20,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5104#false} is VALID [2022-02-20 19:40:20,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#false} ~mode2~0 := 0; {5104#false} is VALID [2022-02-20 19:40:20,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:40:20,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {5104#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5104#false} is VALID [2022-02-20 19:40:20,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {5104#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5104#false} is VALID [2022-02-20 19:40:20,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#false} ~mode3~0 := 0; {5104#false} is VALID [2022-02-20 19:40:20,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:40:20,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5104#false} is VALID [2022-02-20 19:40:20,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {5104#false} check_#res#1 := check_~tmp~1#1; {5104#false} is VALID [2022-02-20 19:40:20,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:40:20,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {5104#false} assume 0 == assert_~arg#1 % 256; {5104#false} is VALID [2022-02-20 19:40:20,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {5104#false} assume !false; {5104#false} is VALID [2022-02-20 19:40:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:20,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:20,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844578295] [2022-02-20 19:40:20,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844578295] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:20,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:20,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:20,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462253604] [2022-02-20 19:40:20,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:20,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:40:20,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:20,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:20,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:20,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:20,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:20,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:20,913 INFO L87 Difference]: Start difference. First operand 814 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:24,563 INFO L93 Difference]: Finished difference Result 856 states and 1599 transitions. [2022-02-20 19:40:24,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 19:40:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-02-20 19:40:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-02-20 19:40:24,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1599 transitions. [2022-02-20 19:40:25,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1599 edges. 1599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:25,787 INFO L225 Difference]: With dead ends: 856 [2022-02-20 19:40:25,788 INFO L226 Difference]: Without dead ends: 814 [2022-02-20 19:40:25,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:40:25,789 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3 mSDsluCounter, 4583 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6117 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:25,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6117 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:25,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-02-20 19:40:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2022-02-20 19:40:25,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:25,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call 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:25,807 INFO L74 IsIncluded]: Start isIncluded. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call 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:25,809 INFO L87 Difference]: Start difference. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call 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:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:25,836 INFO L93 Difference]: Finished difference Result 814 states and 1520 transitions. [2022-02-20 19:40:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:25,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:25,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:25,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:25,841 INFO L87 Difference]: Start difference. First operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:25,868 INFO L93 Difference]: Finished difference Result 814 states and 1520 transitions. [2022-02-20 19:40:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:25,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:25,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:25,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:25,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call 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:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1520 transitions. [2022-02-20 19:40:25,899 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1520 transitions. Word has length 26 [2022-02-20 19:40:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:25,899 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1520 transitions. [2022-02-20 19:40:25,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:25,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:25,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:25,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:40:25,901 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash -698732182, now seen corresponding path program 1 times [2022-02-20 19:40:25,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:25,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187108622] [2022-02-20 19:40:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:25,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:26,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {8443#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; {8443#true} is VALID [2022-02-20 19:40:26,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {8443#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {8443#true} is VALID [2022-02-20 19:40:26,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {8443#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8443#true} is VALID [2022-02-20 19:40:26,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {8443#true} assume 0 == ~r1~0 % 256; {8443#true} is VALID [2022-02-20 19:40:26,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {8443#true} assume ~id1~0 >= 0; {8443#true} is VALID [2022-02-20 19:40:26,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {8443#true} assume 0 == ~st1~0; {8443#true} is VALID [2022-02-20 19:40:26,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {8443#true} assume ~send1~0 == ~id1~0; {8443#true} is VALID [2022-02-20 19:40:26,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {8443#true} assume 0 == ~mode1~0 % 256; {8443#true} is VALID [2022-02-20 19:40:26,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {8443#true} assume ~id2~0 >= 0; {8443#true} is VALID [2022-02-20 19:40:26,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {8443#true} assume 0 == ~st2~0; {8443#true} is VALID [2022-02-20 19:40:26,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {8443#true} assume ~send2~0 == ~id2~0; {8443#true} is VALID [2022-02-20 19:40:26,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {8443#true} assume 0 == ~mode2~0 % 256; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {8445#(= (+ (* (- 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; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {8445#(= (+ (* (- 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; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:26,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {8445#(= (+ (* (- 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; {8444#false} is VALID [2022-02-20 19:40:26,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {8444#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8444#false} is VALID [2022-02-20 19:40:26,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {8444#false} ~mode2~0 := 0; {8444#false} is VALID [2022-02-20 19:40:26,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {8444#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; {8444#false} is VALID [2022-02-20 19:40:26,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {8444#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8444#false} is VALID [2022-02-20 19:40:26,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {8444#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8444#false} is VALID [2022-02-20 19:40:26,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {8444#false} ~mode3~0 := 0; {8444#false} is VALID [2022-02-20 19:40:26,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {8444#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; {8444#false} is VALID [2022-02-20 19:40:26,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {8444#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8444#false} is VALID [2022-02-20 19:40:26,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {8444#false} check_#res#1 := check_~tmp~1#1; {8444#false} is VALID [2022-02-20 19:40:26,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {8444#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; {8444#false} is VALID [2022-02-20 19:40:26,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#false} assume 0 == assert_~arg#1 % 256; {8444#false} is VALID [2022-02-20 19:40:26,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {8444#false} assume !false; {8444#false} is VALID [2022-02-20 19:40:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:26,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:26,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187108622] [2022-02-20 19:40:26,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187108622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:26,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:26,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:26,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061010946] [2022-02-20 19:40:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:26,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:26,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:26,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:26,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:26,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:26,052 INFO L87 Difference]: Start difference. First operand 814 states and 1520 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:27,755 INFO L93 Difference]: Finished difference Result 884 states and 1628 transitions. [2022-02-20 19:40:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:27,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:27,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1628 transitions. [2022-02-20 19:40:29,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:29,152 INFO L225 Difference]: With dead ends: 884 [2022-02-20 19:40:29,152 INFO L226 Difference]: Without dead ends: 846 [2022-02-20 19:40:29,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:29,154 INFO L933 BasicCegarLoop]: 1549 mSDtfsCounter, 1484 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:29,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 1610 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-02-20 19:40:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2022-02-20 19:40:29,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:29,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 846 states. Second operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call 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:29,168 INFO L74 IsIncluded]: Start isIncluded. First operand 846 states. Second operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call 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:29,169 INFO L87 Difference]: Start difference. First operand 846 states. Second operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call 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:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:29,195 INFO L93 Difference]: Finished difference Result 846 states and 1568 transitions. [2022-02-20 19:40:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1568 transitions. [2022-02-20 19:40:29,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:29,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:29,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 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 846 states. [2022-02-20 19:40:29,200 INFO L87 Difference]: Start difference. First operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 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 846 states. [2022-02-20 19:40:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:29,225 INFO L93 Difference]: Finished difference Result 846 states and 1568 transitions. [2022-02-20 19:40:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1568 transitions. [2022-02-20 19:40:29,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:29,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:29,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:29,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call 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:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1567 transitions. [2022-02-20 19:40:29,254 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1567 transitions. Word has length 41 [2022-02-20 19:40:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:29,254 INFO L470 AbstractCegarLoop]: Abstraction has 844 states and 1567 transitions. [2022-02-20 19:40:29,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1567 transitions. [2022-02-20 19:40:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:29,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:29,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:29,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:40:29,256 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash -360939040, now seen corresponding path program 1 times [2022-02-20 19:40:29,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:29,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808768513] [2022-02-20 19:40:29,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:29,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {11910#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; {11910#true} is VALID [2022-02-20 19:40:29,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {11910#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {11910#true} is VALID [2022-02-20 19:40:29,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {11910#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {11910#true} is VALID [2022-02-20 19:40:29,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {11910#true} assume 0 == ~r1~0 % 256; {11910#true} is VALID [2022-02-20 19:40:29,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {11910#true} assume ~id1~0 >= 0; {11910#true} is VALID [2022-02-20 19:40:29,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {11910#true} assume 0 == ~st1~0; {11910#true} is VALID [2022-02-20 19:40:29,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {11910#true} assume ~send1~0 == ~id1~0; {11910#true} is VALID [2022-02-20 19:40:29,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {11910#true} assume 0 == ~mode1~0 % 256; {11910#true} is VALID [2022-02-20 19:40:29,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {11910#true} assume ~id2~0 >= 0; {11910#true} is VALID [2022-02-20 19:40:29,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {11910#true} assume 0 == ~st2~0; {11910#true} is VALID [2022-02-20 19:40:29,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {11910#true} assume ~send2~0 == ~id2~0; {11910#true} is VALID [2022-02-20 19:40:29,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {11910#true} assume 0 == ~mode2~0 % 256; {11910#true} is VALID [2022-02-20 19:40:29,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {11910#true} assume ~id3~0 >= 0; {11910#true} is VALID [2022-02-20 19:40:29,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {11910#true} assume 0 == ~st3~0; {11910#true} is VALID [2022-02-20 19:40:29,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {11910#true} assume ~send3~0 == ~id3~0; {11910#true} is VALID [2022-02-20 19:40:29,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {11910#true} assume 0 == ~mode3~0 % 256; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:29,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {11912#(= (+ (* (- 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; {11911#false} is VALID [2022-02-20 19:40:29,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {11911#false} assume !(node3_~m3~0#1 != ~nomsg~0); {11911#false} is VALID [2022-02-20 19:40:29,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {11911#false} ~mode3~0 := 0; {11911#false} is VALID [2022-02-20 19:40:29,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {11911#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; {11911#false} is VALID [2022-02-20 19:40:29,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {11911#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {11911#false} is VALID [2022-02-20 19:40:29,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {11911#false} check_#res#1 := check_~tmp~1#1; {11911#false} is VALID [2022-02-20 19:40:29,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {11911#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; {11911#false} is VALID [2022-02-20 19:40:29,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {11911#false} assume 0 == assert_~arg#1 % 256; {11911#false} is VALID [2022-02-20 19:40:29,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {11911#false} assume !false; {11911#false} is VALID [2022-02-20 19:40:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:29,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:29,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808768513] [2022-02-20 19:40:29,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808768513] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:29,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:29,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:29,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400705781] [2022-02-20 19:40:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:29,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:29,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:29,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:29,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:29,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:29,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:29,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:29,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:29,335 INFO L87 Difference]: Start difference. First operand 844 states and 1567 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:30,910 INFO L93 Difference]: Finished difference Result 968 states and 1759 transitions. [2022-02-20 19:40:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:30,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:30,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1628 transitions. [2022-02-20 19:40:32,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:32,275 INFO L225 Difference]: With dead ends: 968 [2022-02-20 19:40:32,275 INFO L226 Difference]: Without dead ends: 900 [2022-02-20 19:40:32,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:32,276 INFO L933 BasicCegarLoop]: 1544 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:32,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 1609 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-02-20 19:40:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 898. [2022-02-20 19:40:32,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:32,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 900 states. Second operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,293 INFO L74 IsIncluded]: Start isIncluded. First operand 900 states. Second operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,295 INFO L87 Difference]: Start difference. First operand 900 states. Second operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:32,325 INFO L93 Difference]: Finished difference Result 900 states and 1651 transitions. [2022-02-20 19:40:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1651 transitions. [2022-02-20 19:40:32,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:32,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:32,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 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 900 states. [2022-02-20 19:40:32,336 INFO L87 Difference]: Start difference. First operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 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 900 states. [2022-02-20 19:40:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:32,365 INFO L93 Difference]: Finished difference Result 900 states and 1651 transitions. [2022-02-20 19:40:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1651 transitions. [2022-02-20 19:40:32,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:32,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:32,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:32,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1650 transitions. [2022-02-20 19:40:32,396 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1650 transitions. Word has length 41 [2022-02-20 19:40:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:32,396 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 1650 transitions. [2022-02-20 19:40:32,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1650 transitions. [2022-02-20 19:40:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:32,398 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:32,398 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:32,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:40:32,398 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 857046358, now seen corresponding path program 1 times [2022-02-20 19:40:32,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:32,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710473474] [2022-02-20 19:40:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:32,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {15653#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; {15653#true} is VALID [2022-02-20 19:40:32,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {15653#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {15653#true} is VALID [2022-02-20 19:40:32,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {15653#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15653#true} is VALID [2022-02-20 19:40:32,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {15653#true} assume 0 == ~r1~0 % 256; {15653#true} is VALID [2022-02-20 19:40:32,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {15653#true} assume ~id1~0 >= 0; {15653#true} is VALID [2022-02-20 19:40:32,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {15653#true} assume 0 == ~st1~0; {15655#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:32,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {15655#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {15655#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:32,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {15655#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {15655#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:32,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {15655#(<= ~st1~0 0)} assume ~id2~0 >= 0; {15655#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:32,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {15655#(<= ~st1~0 0)} assume 0 == ~st2~0; {15656#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {15656#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {15656#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15656#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {15656#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {15656#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,465 INFO L290 TraceCheckUtils]: 36: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {15654#false} is VALID [2022-02-20 19:40:32,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {15654#false} check_#res#1 := check_~tmp~1#1; {15654#false} is VALID [2022-02-20 19:40:32,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {15654#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; {15654#false} is VALID [2022-02-20 19:40:32,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {15654#false} assume 0 == assert_~arg#1 % 256; {15654#false} is VALID [2022-02-20 19:40:32,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {15654#false} assume !false; {15654#false} is VALID [2022-02-20 19:40:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:32,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:32,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710473474] [2022-02-20 19:40:32,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710473474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:32,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:32,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:32,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666786568] [2022-02-20 19:40:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:32,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:32,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:32,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:32,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:32,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:32,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:32,491 INFO L87 Difference]: Start difference. First operand 898 states and 1650 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:34,725 INFO L93 Difference]: Finished difference Result 1630 states and 2784 transitions. [2022-02-20 19:40:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:40:34,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1874 transitions. [2022-02-20 19:40:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1874 transitions. [2022-02-20 19:40:34,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1874 transitions. [2022-02-20 19:40:36,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1874 edges. 1874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:36,265 INFO L225 Difference]: With dead ends: 1630 [2022-02-20 19:40:36,265 INFO L226 Difference]: Without dead ends: 1508 [2022-02-20 19:40:36,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:36,266 INFO L933 BasicCegarLoop]: 1516 mSDtfsCounter, 4693 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:36,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4693 Valid, 1934 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-02-20 19:40:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1018. [2022-02-20 19:40:36,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:36,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call 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:36,334 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call 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:36,335 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call 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:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:36,396 INFO L93 Difference]: Finished difference Result 1508 states and 2571 transitions. [2022-02-20 19:40:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2571 transitions. [2022-02-20 19:40:36,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:36,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:36,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 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 1508 states. [2022-02-20 19:40:36,401 INFO L87 Difference]: Start difference. First operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 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 1508 states. [2022-02-20 19:40:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:36,461 INFO L93 Difference]: Finished difference Result 1508 states and 2571 transitions. [2022-02-20 19:40:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2571 transitions. [2022-02-20 19:40:36,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:36,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:36,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:36,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call 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:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1830 transitions. [2022-02-20 19:40:36,501 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1830 transitions. Word has length 41 [2022-02-20 19:40:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:36,501 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 1830 transitions. [2022-02-20 19:40:36,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1830 transitions. [2022-02-20 19:40:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:36,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:36,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:36,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:40:36,503 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1867096070, now seen corresponding path program 1 times [2022-02-20 19:40:36,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:36,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288876178] [2022-02-20 19:40:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:36,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {21559#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; {21559#true} is VALID [2022-02-20 19:40:36,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {21559#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {21559#true} is VALID [2022-02-20 19:40:36,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {21559#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21559#true} is VALID [2022-02-20 19:40:36,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {21559#true} assume 0 == ~r1~0 % 256; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:36,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {21560#false} is VALID [2022-02-20 19:40:36,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {21560#false} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {21560#false} is VALID [2022-02-20 19:40:36,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {21560#false} check_#res#1 := check_~tmp~1#1; {21560#false} is VALID [2022-02-20 19:40:36,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {21560#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; {21560#false} is VALID [2022-02-20 19:40:36,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {21560#false} assume 0 == assert_~arg#1 % 256; {21560#false} is VALID [2022-02-20 19:40:36,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {21560#false} assume !false; {21560#false} is VALID [2022-02-20 19:40:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:36,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:36,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288876178] [2022-02-20 19:40:36,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288876178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:36,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:36,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:36,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832521438] [2022-02-20 19:40:36,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:36,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:36,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:36,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:36,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:36,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:36,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:36,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:36,631 INFO L87 Difference]: Start difference. First operand 1018 states and 1830 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:38,092 INFO L93 Difference]: Finished difference Result 1458 states and 2492 transitions. [2022-02-20 19:40:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:38,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2022-02-20 19:40:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2022-02-20 19:40:38,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1629 transitions. [2022-02-20 19:40:39,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1629 edges. 1629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:39,395 INFO L225 Difference]: With dead ends: 1458 [2022-02-20 19:40:39,395 INFO L226 Difference]: Without dead ends: 1216 [2022-02-20 19:40:39,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:39,396 INFO L933 BasicCegarLoop]: 1517 mSDtfsCounter, 1471 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:39,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1471 Valid, 1569 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-02-20 19:40:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1206. [2022-02-20 19:40:39,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:39,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1216 states. Second operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,546 INFO L74 IsIncluded]: Start isIncluded. First operand 1216 states. Second operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,547 INFO L87 Difference]: Start difference. First operand 1216 states. Second operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:39,588 INFO L93 Difference]: Finished difference Result 1216 states and 2103 transitions. [2022-02-20 19:40:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2103 transitions. [2022-02-20 19:40:39,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:39,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:39,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 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 1216 states. [2022-02-20 19:40:39,592 INFO L87 Difference]: Start difference. First operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 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 1216 states. [2022-02-20 19:40:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:39,634 INFO L93 Difference]: Finished difference Result 1216 states and 2103 transitions. [2022-02-20 19:40:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2103 transitions. [2022-02-20 19:40:39,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:39,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:39,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:39,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2094 transitions. [2022-02-20 19:40:39,680 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2094 transitions. Word has length 43 [2022-02-20 19:40:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:39,680 INFO L470 AbstractCegarLoop]: Abstraction has 1206 states and 2094 transitions. [2022-02-20 19:40:39,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2094 transitions. [2022-02-20 19:40:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:39,681 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:39,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:39,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:40:39,681 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1933589582, now seen corresponding path program 1 times [2022-02-20 19:40:39,682 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:39,682 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246294460] [2022-02-20 19:40:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:39,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {26904#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; {26904#true} is VALID [2022-02-20 19:40:39,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {26904#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {26904#true} is VALID [2022-02-20 19:40:39,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {26904#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {26904#true} is VALID [2022-02-20 19:40:39,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {26904#true} assume 0 == ~r1~0 % 256; {26904#true} is VALID [2022-02-20 19:40:39,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {26904#true} assume ~id1~0 >= 0; {26904#true} is VALID [2022-02-20 19:40:39,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {26904#true} assume 0 == ~st1~0; {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:39,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {26906#(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; {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:39,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {26906#(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; {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:39,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {26906#(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; {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:39,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {26906#(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; {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:39,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {26907#(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; {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:39,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {26907#(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; {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:39,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {26907#(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; {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:39,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {26907#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {26908#(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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:39,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {26908#(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; {26905#false} is VALID [2022-02-20 19:40:39,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {26905#false} check_#res#1 := check_~tmp~1#1; {26905#false} is VALID [2022-02-20 19:40:39,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {26905#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; {26905#false} is VALID [2022-02-20 19:40:39,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {26905#false} assume 0 == assert_~arg#1 % 256; {26905#false} is VALID [2022-02-20 19:40:39,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {26905#false} assume !false; {26905#false} is VALID [2022-02-20 19:40:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:39,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:39,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246294460] [2022-02-20 19:40:39,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246294460] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:39,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:39,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:39,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456792154] [2022-02-20 19:40:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:39,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:39,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:39,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:39,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:39,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:39,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:39,891 INFO L87 Difference]: Start difference. First operand 1206 states and 2094 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:42,385 INFO L93 Difference]: Finished difference Result 1638 states and 2728 transitions. [2022-02-20 19:40:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2022-02-20 19:40:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2022-02-20 19:40:42,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1636 transitions. [2022-02-20 19:40:43,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1636 edges. 1636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:43,711 INFO L225 Difference]: With dead ends: 1638 [2022-02-20 19:40:43,711 INFO L226 Difference]: Without dead ends: 1208 [2022-02-20 19:40:43,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:40:43,712 INFO L933 BasicCegarLoop]: 1515 mSDtfsCounter, 3008 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3008 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:43,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3008 Valid, 1625 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-02-20 19:40:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1206. [2022-02-20 19:40:43,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:43,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1208 states. Second operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:43,884 INFO L74 IsIncluded]: Start isIncluded. First operand 1208 states. Second operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:43,886 INFO L87 Difference]: Start difference. First operand 1208 states. Second operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:43,956 INFO L93 Difference]: Finished difference Result 1208 states and 2087 transitions. [2022-02-20 19:40:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2087 transitions. [2022-02-20 19:40:43,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:43,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:43,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 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 1208 states. [2022-02-20 19:40:43,959 INFO L87 Difference]: Start difference. First operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 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 1208 states. [2022-02-20 19:40:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:43,999 INFO L93 Difference]: Finished difference Result 1208 states and 2087 transitions. [2022-02-20 19:40:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2087 transitions. [2022-02-20 19:40:44,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:44,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:44,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:44,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2086 transitions. [2022-02-20 19:40:44,044 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2086 transitions. Word has length 43 [2022-02-20 19:40:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:44,045 INFO L470 AbstractCegarLoop]: Abstraction has 1206 states and 2086 transitions. [2022-02-20 19:40:44,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2086 transitions. [2022-02-20 19:40:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:40:44,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:44,045 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:40:44,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:40:44,046 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:44,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash -602988295, now seen corresponding path program 1 times [2022-02-20 19:40:44,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:44,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865983089] [2022-02-20 19:40:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:44,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:44,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {32461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {32461#true} is VALID [2022-02-20 19:40:44,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {32461#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {32461#true} is VALID [2022-02-20 19:40:44,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {32461#true} assume 0 == ~r1~0 % 256; {32461#true} is VALID [2022-02-20 19:40:44,139 INFO L290 TraceCheckUtils]: 4: Hoare triple {32461#true} assume ~id1~0 >= 0; {32461#true} is VALID [2022-02-20 19:40:44,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {32461#true} assume 0 == ~st1~0; {32461#true} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {32461#true} assume ~send1~0 == ~id1~0; {32461#true} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {32461#true} assume 0 == ~mode1~0 % 256; {32461#true} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {32461#true} assume ~id2~0 >= 0; {32461#true} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {32461#true} assume 0 == ~st2~0; {32461#true} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {32461#true} assume ~send2~0 == ~id2~0; {32461#true} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {32461#true} assume 0 == ~mode2~0 % 256; {32461#true} is VALID [2022-02-20 19:40:44,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {32461#true} assume ~id3~0 >= 0; {32461#true} is VALID [2022-02-20 19:40:44,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {32461#true} assume 0 == ~st3~0; {32461#true} is VALID [2022-02-20 19:40:44,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {32461#true} assume ~send3~0 == ~id3~0; {32461#true} is VALID [2022-02-20 19:40:44,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {32461#true} assume 0 == ~mode3~0 % 256; {32461#true} is VALID [2022-02-20 19:40:44,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {32461#true} assume ~id1~0 != ~id2~0; {32461#true} is VALID [2022-02-20 19:40:44,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {32461#true} assume ~id1~0 != ~id3~0; {32461#true} is VALID [2022-02-20 19:40:44,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {32461#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {32463#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:40:44,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {32463#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {32464#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:40:44,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {32464#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {32465#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:40:44,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {32465#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {32461#true} is VALID [2022-02-20 19:40:44,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {32461#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {32461#true} is VALID [2022-02-20 19:40:44,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {32461#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {32461#true} is VALID [2022-02-20 19:40:44,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {32461#true} assume !(0 != ~mode1~0 % 256); {32461#true} is VALID [2022-02-20 19:40:44,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {32461#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {32461#true} is VALID [2022-02-20 19:40:44,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:44,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:44,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {32461#true} assume !(0 != ~mode2~0 % 256); {32461#true} is VALID [2022-02-20 19:40:44,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {32461#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {32461#true} is VALID [2022-02-20 19:40:44,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:44,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:44,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {32461#true} assume !(0 != ~mode3~0 % 256); {32461#true} is VALID [2022-02-20 19:40:44,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {32461#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {32461#true} is VALID [2022-02-20 19:40:44,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:44,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:44,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {32461#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32461#true} is VALID [2022-02-20 19:40:44,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {32461#true} assume !(~r1~0 % 256 >= 3); {32461#true} is VALID [2022-02-20 19:40:44,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {32461#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {32461#true} is VALID [2022-02-20 19:40:44,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {32461#true} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {32466#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:40:44,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {32466#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {32467#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:40:44,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {32467#(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; {32468#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:40:44,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {32468#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {32462#false} is VALID [2022-02-20 19:40:44,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {32462#false} assume !false; {32462#false} is VALID [2022-02-20 19:40:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:44,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:44,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865983089] [2022-02-20 19:40:44,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865983089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:44,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:44,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:40:44,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822355753] [2022-02-20 19:40:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:44,151 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:44,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:44,151 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:40:44,172 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:40:44,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:40:44,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:40:44,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:44,174 INFO L87 Difference]: Start difference. First operand 1206 states and 2086 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:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:50,651 INFO L93 Difference]: Finished difference Result 1540 states and 2558 transitions. [2022-02-20 19:40:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:40:50,651 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:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:50,655 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:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1583 transitions. [2022-02-20 19:40:50,660 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:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1583 transitions. [2022-02-20 19:40:50,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1583 transitions. [2022-02-20 19:40:51,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1583 edges. 1583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:51,815 INFO L225 Difference]: With dead ends: 1540 [2022-02-20 19:40:51,815 INFO L226 Difference]: Without dead ends: 1538 [2022-02-20 19:40:51,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:40:51,816 INFO L933 BasicCegarLoop]: 1552 mSDtfsCounter, 396 mSDsluCounter, 8921 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 10473 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:51,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 10473 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-02-20 19:40:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1230. [2022-02-20 19:40:52,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:52,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1538 states. Second operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call 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:52,081 INFO L74 IsIncluded]: Start isIncluded. First operand 1538 states. Second operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call 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:52,082 INFO L87 Difference]: Start difference. First operand 1538 states. Second operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call 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:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:52,154 INFO L93 Difference]: Finished difference Result 1538 states and 2545 transitions. [2022-02-20 19:40:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2545 transitions. [2022-02-20 19:40:52,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:52,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:52,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 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 1538 states. [2022-02-20 19:40:52,159 INFO L87 Difference]: Start difference. First operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 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 1538 states. [2022-02-20 19:40:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:52,232 INFO L93 Difference]: Finished difference Result 1538 states and 2545 transitions. [2022-02-20 19:40:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2545 transitions. [2022-02-20 19:40:52,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:52,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:52,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:52,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call 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:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2106 transitions. [2022-02-20 19:40:52,280 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2106 transitions. Word has length 44 [2022-02-20 19:40:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:52,280 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 2106 transitions. [2022-02-20 19:40:52,280 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:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2106 transitions. [2022-02-20 19:40:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:40:52,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:52,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:52,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:40:52,281 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:52,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1900121563, now seen corresponding path program 1 times [2022-02-20 19:40:52,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:52,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054048206] [2022-02-20 19:40:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:52,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {38622#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; {38622#true} is VALID [2022-02-20 19:40:52,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {38622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {38622#true} is VALID [2022-02-20 19:40:52,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {38622#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38622#true} is VALID [2022-02-20 19:40:52,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {38622#true} assume 0 == ~r1~0 % 256; {38622#true} is VALID [2022-02-20 19:40:52,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {38622#true} assume ~id1~0 >= 0; {38622#true} is VALID [2022-02-20 19:40:52,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {38622#true} assume 0 == ~st1~0; {38622#true} is VALID [2022-02-20 19:40:52,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {38622#true} assume ~send1~0 == ~id1~0; {38622#true} is VALID [2022-02-20 19:40:52,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {38622#true} assume 0 == ~mode1~0 % 256; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:52,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {38623#false} is VALID [2022-02-20 19:40:52,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {38623#false} assume !(255 == ~r1~0 % 256); {38623#false} is VALID [2022-02-20 19:40:52,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {38623#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38623#false} is VALID [2022-02-20 19:40:52,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {38623#false} assume node1_~m1~0#1 != ~nomsg~0; {38623#false} is VALID [2022-02-20 19:40:52,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {38623#false} assume !(node1_~m1~0#1 > ~id1~0); {38623#false} is VALID [2022-02-20 19:40:52,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {38623#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {38623#false} is VALID [2022-02-20 19:40:52,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {38623#false} ~mode1~0 := 0; {38623#false} is VALID [2022-02-20 19:40:52,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:52,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {38623#false} assume !(0 != ~mode2~0 % 256); {38623#false} is VALID [2022-02-20 19:40:52,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {38623#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {38623#false} is VALID [2022-02-20 19:40:52,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:52,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:52,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {38623#false} assume !(0 != ~mode3~0 % 256); {38623#false} is VALID [2022-02-20 19:40:52,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {38623#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {38623#false} is VALID [2022-02-20 19:40:52,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:52,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:52,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {38623#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {38623#false} is VALID [2022-02-20 19:40:52,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {38623#false} check_#res#1 := check_~tmp~1#1; {38623#false} is VALID [2022-02-20 19:40:52,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:52,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {38623#false} assume 0 == assert_~arg#1 % 256; {38623#false} is VALID [2022-02-20 19:40:52,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {38623#false} assume !false; {38623#false} is VALID [2022-02-20 19:40:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:52,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:52,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054048206] [2022-02-20 19:40:52,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054048206] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:52,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:52,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:52,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469766355] [2022-02-20 19:40:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 19:40:52,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:52,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call 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:52,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:52,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:52,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:52,350 INFO L87 Difference]: Start difference. First operand 1230 states and 2106 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:54,262 INFO L93 Difference]: Finished difference Result 1701 states and 2784 transitions. [2022-02-20 19:40:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 19:40:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1625 transitions. [2022-02-20 19:40:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1625 transitions. [2022-02-20 19:40:54,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1625 transitions. [2022-02-20 19:40:55,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1625 edges. 1625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:55,593 INFO L225 Difference]: With dead ends: 1701 [2022-02-20 19:40:55,593 INFO L226 Difference]: Without dead ends: 1434 [2022-02-20 19:40:55,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:55,597 INFO L933 BasicCegarLoop]: 1558 mSDtfsCounter, 1485 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:55,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1615 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2022-02-20 19:40:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2022-02-20 19:40:55,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:55,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1434 states. Second operand has 1432 states, 1430 states have (on average 1.6671328671328671) internal successors, (2384), 1431 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call 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:55,989 INFO L74 IsIncluded]: Start isIncluded. First operand 1434 states. Second operand has 1432 states, 1430 states have (on average 1.6671328671328671) internal successors, (2384), 1431 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call 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:55,990 INFO L87 Difference]: Start difference. First operand 1434 states. Second operand has 1432 states, 1430 states have (on average 1.6671328671328671) internal successors, (2384), 1431 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:56,043 INFO L93 Difference]: Finished difference Result 1434 states and 2385 transitions. [2022-02-20 19:40:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2385 transitions. [2022-02-20 19:40:56,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:56,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:56,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 1432 states, 1430 states have (on average 1.6671328671328671) internal successors, (2384), 1431 states have internal predecessors, (2384), 0 states have call successors, (0), 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 1434 states. [2022-02-20 19:40:56,048 INFO L87 Difference]: Start difference. First operand has 1432 states, 1430 states have (on average 1.6671328671328671) internal successors, (2384), 1431 states have internal predecessors, (2384), 0 states have call successors, (0), 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 1434 states. [2022-02-20 19:40:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:56,102 INFO L93 Difference]: Finished difference Result 1434 states and 2385 transitions. [2022-02-20 19:40:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2385 transitions. [2022-02-20 19:40:56,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:56,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:56,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:56,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1430 states have (on average 1.6671328671328671) internal successors, (2384), 1431 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2384 transitions. [2022-02-20 19:40:56,163 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2384 transitions. Word has length 45 [2022-02-20 19:40:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:56,163 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 2384 transitions. [2022-02-20 19:40:56,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2384 transitions. [2022-02-20 19:40:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:56,164 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:56,164 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:56,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:40:56,164 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash -393288849, now seen corresponding path program 1 times [2022-02-20 19:40:56,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:56,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039830691] [2022-02-20 19:40:56,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:56,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:56,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {45010#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; {45010#true} is VALID [2022-02-20 19:40:56,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {45010#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {45010#true} is VALID [2022-02-20 19:40:56,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {45010#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {45010#true} is VALID [2022-02-20 19:40:56,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {45010#true} assume 0 == ~r1~0 % 256; {45010#true} is VALID [2022-02-20 19:40:56,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {45010#true} assume ~id1~0 >= 0; {45010#true} is VALID [2022-02-20 19:40:56,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {45010#true} assume 0 == ~st1~0; {45012#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:56,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {45012#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {45012#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:56,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {45012#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {45012#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:56,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {45012#(<= ~st1~0 0)} assume ~id2~0 >= 0; {45012#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:56,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {45012#(<= ~st1~0 0)} assume 0 == ~st2~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {45013#(<= (+ ~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; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,237 INFO L290 TraceCheckUtils]: 54: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {45013#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:56,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {45013#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {45014#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:56,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {45014#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {45014#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:56,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {45014#(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; {45014#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:56,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {45014#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {45011#false} is VALID [2022-02-20 19:40:56,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {45011#false} check_#res#1 := check_~tmp~1#1; {45011#false} is VALID [2022-02-20 19:40:56,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {45011#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; {45011#false} is VALID [2022-02-20 19:40:56,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {45011#false} assume 0 == assert_~arg#1 % 256; {45011#false} is VALID [2022-02-20 19:40:56,239 INFO L290 TraceCheckUtils]: 63: Hoare triple {45011#false} assume !false; {45011#false} is VALID [2022-02-20 19:40:56,240 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:56,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:56,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039830691] [2022-02-20 19:40:56,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039830691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:56,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:56,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:56,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846109366] [2022-02-20 19:40:56,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:56,241 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:56,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:56,241 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:56,273 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:56,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:56,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:56,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:56,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:56,274 INFO L87 Difference]: Start difference. First operand 1432 states and 2384 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:41:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:00,226 INFO L93 Difference]: Finished difference Result 3536 states and 5336 transitions. [2022-02-20 19:41:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:41:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:41:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:00,226 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:41:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1753 transitions. [2022-02-20 19:41:00,231 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:41:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1753 transitions. [2022-02-20 19:41:00,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1753 transitions. [2022-02-20 19:41:01,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1753 edges. 1753 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:01,760 INFO L225 Difference]: With dead ends: 3536 [2022-02-20 19:41:01,761 INFO L226 Difference]: Without dead ends: 2882 [2022-02-20 19:41:01,762 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:41:01,762 INFO L933 BasicCegarLoop]: 1568 mSDtfsCounter, 3084 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3084 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:41:01,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3084 Valid, 3199 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2022-02-20 19:41:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2084. [2022-02-20 19:41:02,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:02,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2882 states. Second operand has 2084 states, 2082 states have (on average 1.5811719500480308) internal successors, (3292), 2083 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:02,451 INFO L74 IsIncluded]: Start isIncluded. First operand 2882 states. Second operand has 2084 states, 2082 states have (on average 1.5811719500480308) internal successors, (3292), 2083 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:02,452 INFO L87 Difference]: Start difference. First operand 2882 states. Second operand has 2084 states, 2082 states have (on average 1.5811719500480308) internal successors, (3292), 2083 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:02,657 INFO L93 Difference]: Finished difference Result 2882 states and 4403 transitions. [2022-02-20 19:41:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 4403 transitions. [2022-02-20 19:41:02,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:02,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:02,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 2084 states, 2082 states have (on average 1.5811719500480308) internal successors, (3292), 2083 states have internal predecessors, (3292), 0 states have call successors, (0), 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 2882 states. [2022-02-20 19:41:02,696 INFO L87 Difference]: Start difference. First operand has 2084 states, 2082 states have (on average 1.5811719500480308) internal successors, (3292), 2083 states have internal predecessors, (3292), 0 states have call successors, (0), 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 2882 states. [2022-02-20 19:41:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:02,901 INFO L93 Difference]: Finished difference Result 2882 states and 4403 transitions. [2022-02-20 19:41:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 4403 transitions. [2022-02-20 19:41:02,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:02,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:02,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:02,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2082 states have (on average 1.5811719500480308) internal successors, (3292), 2083 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3292 transitions. [2022-02-20 19:41:03,037 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3292 transitions. Word has length 64 [2022-02-20 19:41:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:03,037 INFO L470 AbstractCegarLoop]: Abstraction has 2084 states and 3292 transitions. [2022-02-20 19:41:03,038 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:41:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3292 transitions. [2022-02-20 19:41:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:41:03,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:03,039 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:41:03,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:41:03,039 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2132895631, now seen corresponding path program 1 times [2022-02-20 19:41:03,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:03,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594498696] [2022-02-20 19:41:03,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:03,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:03,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {57392#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; {57392#true} is VALID [2022-02-20 19:41:03,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {57392#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {57392#true} is VALID [2022-02-20 19:41:03,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {57392#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {57392#true} is VALID [2022-02-20 19:41:03,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {57392#true} assume 0 == ~r1~0 % 256; {57392#true} is VALID [2022-02-20 19:41:03,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {57392#true} assume ~id1~0 >= 0; {57392#true} is VALID [2022-02-20 19:41:03,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {57392#true} assume 0 == ~st1~0; {57394#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:03,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {57394#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {57394#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:03,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {57394#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {57394#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:03,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {57394#(<= ~st1~0 0)} assume ~id2~0 >= 0; {57394#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:03,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {57394#(<= ~st1~0 0)} assume 0 == ~st2~0; {57394#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:03,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {57394#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {57394#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:03,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {57394#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {57394#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:03,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {57394#(<= ~st1~0 0)} assume ~id3~0 >= 0; {57394#(<= ~st1~0 0)} is VALID [2022-02-20 19:41:03,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {57394#(<= ~st1~0 0)} assume 0 == ~st3~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {57395#(<= (+ ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {57395#(<= (+ ~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; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {57395#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:41:03,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {57395#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:41:03,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:41:03,103 INFO L290 TraceCheckUtils]: 54: Hoare triple {57396#(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; {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:41:03,104 INFO L290 TraceCheckUtils]: 55: Hoare triple {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:41:03,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:41:03,104 INFO L290 TraceCheckUtils]: 57: Hoare triple {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:41:03,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {57396#(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; {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:41:03,105 INFO L290 TraceCheckUtils]: 59: Hoare triple {57396#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {57393#false} is VALID [2022-02-20 19:41:03,105 INFO L290 TraceCheckUtils]: 60: Hoare triple {57393#false} check_#res#1 := check_~tmp~1#1; {57393#false} is VALID [2022-02-20 19:41:03,105 INFO L290 TraceCheckUtils]: 61: Hoare triple {57393#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; {57393#false} is VALID [2022-02-20 19:41:03,105 INFO L290 TraceCheckUtils]: 62: Hoare triple {57393#false} assume 0 == assert_~arg#1 % 256; {57393#false} is VALID [2022-02-20 19:41:03,106 INFO L290 TraceCheckUtils]: 63: Hoare triple {57393#false} assume !false; {57393#false} is VALID [2022-02-20 19:41:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 19:41:03,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:03,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594498696] [2022-02-20 19:41:03,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594498696] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:03,108 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:03,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:41:03,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627242881] [2022-02-20 19:41:03,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:41:03,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:03,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:03,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:03,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:41:03,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:41:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:41:03,145 INFO L87 Difference]: Start difference. First operand 2084 states and 3292 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:07,669 INFO L93 Difference]: Finished difference Result 4188 states and 6244 transitions. [2022-02-20 19:41:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:41:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:41:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1753 transitions. [2022-02-20 19:41:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1753 transitions. [2022-02-20 19:41:07,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1753 transitions.