./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.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.4.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 b320c505e975e60a8773fab452d31c385380f52ca8479f4ba88c3e2472a94a3a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:42:43,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:42:43,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:42:43,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:42:43,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:42:43,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:42:43,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:42:43,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:42:43,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:42:43,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:42:43,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:42:43,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:42:43,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:42:43,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:42:43,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:42:43,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:42:43,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:42:43,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:42:43,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:42:43,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:42:43,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:42:43,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:42:43,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:42:43,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:42:43,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:42:43,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:42:43,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:42:43,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:42:43,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:42:43,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:42:43,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:42:43,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:42:43,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:42:43,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:42:43,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:42:43,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:42:43,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:42:43,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:42:43,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:42:43,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:42:43,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:42:43,880 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:42:43,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:42:43,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:42:43,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:42:43,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:42:43,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:42:43,905 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:42:43,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:42:43,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:42:43,906 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:42:43,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:42:43,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:42:43,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:42:43,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:42:43,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:42:43,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:42:43,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:42:43,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:42:43,908 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:42:43,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:42:43,908 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:42:43,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:42:43,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:42:43,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:42:43,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:42:43,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:43,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:42:43,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:42:43,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:42:43,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:42:43,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:42:43,910 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:42:43,910 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:42:43,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:42:43,910 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 -> b320c505e975e60a8773fab452d31c385380f52ca8479f4ba88c3e2472a94a3a [2022-02-20 19:42:44,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:42:44,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:42:44,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:42:44,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:42:44,109 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:42:44,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:42:44,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec4350ba/3964c80fa2614a4d977013c220fcb55a/FLAG9c54cfae3 [2022-02-20 19:42:44,638 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:42:44,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:42:44,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec4350ba/3964c80fa2614a4d977013c220fcb55a/FLAG9c54cfae3 [2022-02-20 19:42:45,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec4350ba/3964c80fa2614a4d977013c220fcb55a [2022-02-20 19:42:45,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:42:45,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:42:45,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:45,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:42:45,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:42:45,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:45" (1/1) ... [2022-02-20 19:42:45,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d26e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:45, skipping insertion in model container [2022-02-20 19:42:45,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:45" (1/1) ... [2022-02-20 19:42:45,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:42:45,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:42:45,468 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.4.ufo.UNBOUNDED.pals+Problem12_label09.c[8712,8725] [2022-02-20 19:42:45,506 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.4.ufo.UNBOUNDED.pals+Problem12_label09.c[16460,16473] [2022-02-20 19:42:46,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:46,039 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:42:46,072 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.4.ufo.UNBOUNDED.pals+Problem12_label09.c[8712,8725] [2022-02-20 19:42:46,089 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.4.ufo.UNBOUNDED.pals+Problem12_label09.c[16460,16473] [2022-02-20 19:42:46,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:46,429 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:42:46,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46 WrapperNode [2022-02-20 19:42:46,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:46,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:46,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:42:46,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:42:46,436 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:42:46" (1/1) ... [2022-02-20 19:42:46,477 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:42:46" (1/1) ... [2022-02-20 19:42:46,837 INFO L137 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5031 [2022-02-20 19:42:46,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:46,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:42:46,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:42:46,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:42:46,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (1/1) ... [2022-02-20 19:42:46,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (1/1) ... [2022-02-20 19:42:46,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (1/1) ... [2022-02-20 19:42:46,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (1/1) ... [2022-02-20 19:42:47,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (1/1) ... [2022-02-20 19:42:47,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (1/1) ... [2022-02-20 19:42:47,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (1/1) ... [2022-02-20 19:42:47,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:42:47,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:42:47,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:42:47,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:42:47,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (1/1) ... [2022-02-20 19:42:47,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:47,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:42:47,205 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:42:47,211 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:42:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:42:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:42:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:42:47,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:42:47,303 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:42:47,304 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:42:53,738 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:42:53,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:42:53,750 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:42:53,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:53 BoogieIcfgContainer [2022-02-20 19:42:53,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:42:53,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:42:53,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:42:53,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:42:53,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:42:45" (1/3) ... [2022-02-20 19:42:53,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6817ebcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:53, skipping insertion in model container [2022-02-20 19:42:53,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:46" (2/3) ... [2022-02-20 19:42:53,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6817ebcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:53, skipping insertion in model container [2022-02-20 19:42:53,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:53" (3/3) ... [2022-02-20 19:42:53,762 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:42:53,765 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:42:53,766 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:42:53,805 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:42:53,810 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:42:53,810 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:42:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 895 states, 892 states have (on average 1.9013452914798206) internal successors, (1696), 894 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:53,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:53,850 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] [2022-02-20 19:42:53,850 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2085104645, now seen corresponding path program 1 times [2022-02-20 19:42:53,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:53,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491776366] [2022-02-20 19:42:53,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:54,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {898#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {898#true} is VALID [2022-02-20 19:42:54,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {898#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {898#true} is VALID [2022-02-20 19:42:54,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {898#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {898#true} is VALID [2022-02-20 19:42:54,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {898#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {898#true} is VALID [2022-02-20 19:42:54,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {898#true} init_#res#1 := init_~tmp~0#1; {898#true} is VALID [2022-02-20 19:42:54,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {898#true} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {898#true} is VALID [2022-02-20 19:42:54,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {898#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {899#false} is VALID [2022-02-20 19:42:54,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {899#false} is VALID [2022-02-20 19:42:54,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#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; {899#false} is VALID [2022-02-20 19:42:54,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {899#false} assume !(0 != ~mode1~0 % 256); {899#false} is VALID [2022-02-20 19:42:54,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {899#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {899#false} is VALID [2022-02-20 19:42:54,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {899#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; {899#false} is VALID [2022-02-20 19:42:54,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {899#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; {899#false} is VALID [2022-02-20 19:42:54,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {899#false} assume !(0 != ~mode2~0 % 256); {899#false} is VALID [2022-02-20 19:42:54,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {899#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {899#false} is VALID [2022-02-20 19:42:54,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#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; {899#false} is VALID [2022-02-20 19:42:54,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {899#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; {899#false} is VALID [2022-02-20 19:42:54,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {899#false} assume !(0 != ~mode3~0 % 256); {899#false} is VALID [2022-02-20 19:42:54,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {899#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {899#false} is VALID [2022-02-20 19:42:54,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {899#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; {899#false} is VALID [2022-02-20 19:42:54,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {899#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {899#false} is VALID [2022-02-20 19:42:54,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {899#false} assume !(0 != ~mode4~0 % 256); {899#false} is VALID [2022-02-20 19:42:54,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {899#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {899#false} is VALID [2022-02-20 19:42:54,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {899#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {899#false} is VALID [2022-02-20 19:42:54,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {899#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {899#false} is VALID [2022-02-20 19:42:54,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {899#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {899#false} is VALID [2022-02-20 19:42:54,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {899#false} check_#res#1 := check_~tmp~1#1; {899#false} is VALID [2022-02-20 19:42:54,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {899#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {899#false} is VALID [2022-02-20 19:42:54,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {899#false} assume 0 == assert_~arg#1 % 256; {899#false} is VALID [2022-02-20 19:42:54,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {899#false} assume !false; {899#false} is VALID [2022-02-20 19:42:54,022 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:42:54,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:54,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491776366] [2022-02-20 19:42:54,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491776366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:54,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:54,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:42:54,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638011442] [2022-02-20 19:42:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:54,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:54,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:54,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:54,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:54,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:42:54,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:42:54,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:42:54,084 INFO L87 Difference]: Start difference. First operand has 895 states, 892 states have (on average 1.9013452914798206) internal successors, (1696), 894 states have internal predecessors, (1696), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:55,383 INFO L93 Difference]: Finished difference Result 1759 states and 3336 transitions. [2022-02-20 19:42:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:42:55,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3336 transitions. [2022-02-20 19:42:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3336 transitions. [2022-02-20 19:42:55,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3336 transitions. [2022-02-20 19:42:57,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3336 edges. 3336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:57,857 INFO L225 Difference]: With dead ends: 1759 [2022-02-20 19:42:57,857 INFO L226 Difference]: Without dead ends: 829 [2022-02-20 19:42:57,865 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:42:57,867 INFO L933 BasicCegarLoop]: 1627 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, 1627 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:42:57,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-02-20 19:42:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2022-02-20 19:42:57,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:57,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,927 INFO L74 IsIncluded]: Start isIncluded. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,929 INFO L87 Difference]: Start difference. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:57,956 INFO L93 Difference]: Finished difference Result 829 states and 1563 transitions. [2022-02-20 19:42:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:57,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:57,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:57,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 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 829 states. [2022-02-20 19:42:57,967 INFO L87 Difference]: Start difference. First operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 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 829 states. [2022-02-20 19:42:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:57,994 INFO L93 Difference]: Finished difference Result 829 states and 1563 transitions. [2022-02-20 19:42:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:57,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:57,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:57,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:57,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1563 transitions. [2022-02-20 19:42:58,028 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1563 transitions. Word has length 30 [2022-02-20 19:42:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:58,032 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1563 transitions. [2022-02-20 19:42:58,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:58,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:58,033 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] [2022-02-20 19:42:58,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:42:58,034 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1951091139, now seen corresponding path program 1 times [2022-02-20 19:42:58,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:58,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851427332] [2022-02-20 19:42:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:58,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {5189#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {5189#true} is VALID [2022-02-20 19:42:58,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {5189#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {5189#true} is VALID [2022-02-20 19:42:58,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {5189#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5189#true} is VALID [2022-02-20 19:42:58,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {5189#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5191#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:42:58,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {5191#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5192#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:42:58,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {5192#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {5193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:42:58,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {5193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5190#false} is VALID [2022-02-20 19:42:58,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {5190#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5190#false} is VALID [2022-02-20 19:42:58,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {5190#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; {5190#false} is VALID [2022-02-20 19:42:58,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {5190#false} assume !(0 != ~mode1~0 % 256); {5190#false} is VALID [2022-02-20 19:42:58,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {5190#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5190#false} is VALID [2022-02-20 19:42:58,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {5190#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; {5190#false} is VALID [2022-02-20 19:42:58,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {5190#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; {5190#false} is VALID [2022-02-20 19:42:58,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {5190#false} assume !(0 != ~mode2~0 % 256); {5190#false} is VALID [2022-02-20 19:42:58,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {5190#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5190#false} is VALID [2022-02-20 19:42:58,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {5190#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; {5190#false} is VALID [2022-02-20 19:42:58,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {5190#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; {5190#false} is VALID [2022-02-20 19:42:58,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {5190#false} assume !(0 != ~mode3~0 % 256); {5190#false} is VALID [2022-02-20 19:42:58,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {5190#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5190#false} is VALID [2022-02-20 19:42:58,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {5190#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; {5190#false} is VALID [2022-02-20 19:42:58,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {5190#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5190#false} is VALID [2022-02-20 19:42:58,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {5190#false} assume !(0 != ~mode4~0 % 256); {5190#false} is VALID [2022-02-20 19:42:58,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {5190#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {5190#false} is VALID [2022-02-20 19:42:58,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {5190#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {5190#false} is VALID [2022-02-20 19:42:58,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {5190#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5190#false} is VALID [2022-02-20 19:42:58,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {5190#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {5190#false} is VALID [2022-02-20 19:42:58,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {5190#false} check_#res#1 := check_~tmp~1#1; {5190#false} is VALID [2022-02-20 19:42:58,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {5190#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {5190#false} is VALID [2022-02-20 19:42:58,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {5190#false} assume 0 == assert_~arg#1 % 256; {5190#false} is VALID [2022-02-20 19:42:58,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {5190#false} assume !false; {5190#false} is VALID [2022-02-20 19:42:58,105 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:42:58,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:58,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851427332] [2022-02-20 19:42:58,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851427332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:58,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:58,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:42:58,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691884428] [2022-02-20 19:42:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:58,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:58,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:58,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:58,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:58,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:42:58,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:42:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:42:58,126 INFO L87 Difference]: Start difference. First operand 829 states and 1563 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:01,706 INFO L93 Difference]: Finished difference Result 879 states and 1639 transitions. [2022-02-20 19:43:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:43:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:43:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2022-02-20 19:43:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2022-02-20 19:43:01,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1639 transitions. [2022-02-20 19:43:02,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1639 edges. 1639 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:02,923 INFO L225 Difference]: With dead ends: 879 [2022-02-20 19:43:02,924 INFO L226 Difference]: Without dead ends: 829 [2022-02-20 19:43:02,924 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:43:02,925 INFO L933 BasicCegarLoop]: 1561 mSDtfsCounter, 3 mSDsluCounter, 4657 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6218 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:02,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-02-20 19:43:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2022-02-20 19:43:02,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:02,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:02,942 INFO L74 IsIncluded]: Start isIncluded. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:02,944 INFO L87 Difference]: Start difference. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:02,968 INFO L93 Difference]: Finished difference Result 829 states and 1540 transitions. [2022-02-20 19:43:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:43:02,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:02,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:02,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 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 829 states. [2022-02-20 19:43:02,973 INFO L87 Difference]: Start difference. First operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 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 829 states. [2022-02-20 19:43:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:03,000 INFO L93 Difference]: Finished difference Result 829 states and 1540 transitions. [2022-02-20 19:43:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:43:03,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:03,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:03,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:03,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1540 transitions. [2022-02-20 19:43:03,028 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1540 transitions. Word has length 30 [2022-02-20 19:43:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:03,029 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1540 transitions. [2022-02-20 19:43:03,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:43:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:03,031 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:03,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:03,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:43:03,032 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash 568524862, now seen corresponding path program 1 times [2022-02-20 19:43:03,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:03,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830360954] [2022-02-20 19:43:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:03,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {8600#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {8600#true} is VALID [2022-02-20 19:43:03,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {8600#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {8600#true} is VALID [2022-02-20 19:43:03,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {8600#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8600#true} is VALID [2022-02-20 19:43:03,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {8600#true} assume 0 == ~r1~0 % 256; {8600#true} is VALID [2022-02-20 19:43:03,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {8600#true} assume ~id1~0 >= 0; {8600#true} is VALID [2022-02-20 19:43:03,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {8600#true} assume 0 == ~st1~0; {8602#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:03,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {8602#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {8602#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:03,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {8602#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {8602#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:03,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {8602#(<= ~st1~0 0)} assume ~id2~0 >= 0; {8602#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:03,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {8602#(<= ~st1~0 0)} assume 0 == ~st2~0; {8603#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {8603#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {8603#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {8603#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {8603#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {8603#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {8603#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {8603#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:03,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {8601#false} is VALID [2022-02-20 19:43:03,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {8601#false} check_#res#1 := check_~tmp~1#1; {8601#false} is VALID [2022-02-20 19:43:03,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {8601#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {8601#false} is VALID [2022-02-20 19:43:03,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {8601#false} assume 0 == assert_~arg#1 % 256; {8601#false} is VALID [2022-02-20 19:43:03,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {8601#false} assume !false; {8601#false} is VALID [2022-02-20 19:43:03,195 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:43:03,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:03,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830360954] [2022-02-20 19:43:03,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830360954] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:03,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:03,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:43:03,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053751052] [2022-02-20 19:43:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:03,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:03,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:03,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:03,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:03,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:03,227 INFO L87 Difference]: Start difference. First operand 829 states and 1540 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:06,221 INFO L93 Difference]: Finished difference Result 1197 states and 2116 transitions. [2022-02-20 19:43:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:43:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2116 transitions. [2022-02-20 19:43:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2116 transitions. [2022-02-20 19:43:06,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2116 transitions. [2022-02-20 19:43:07,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2116 edges. 2116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:07,937 INFO L225 Difference]: With dead ends: 1197 [2022-02-20 19:43:07,937 INFO L226 Difference]: Without dead ends: 1151 [2022-02-20 19:43:07,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:43:07,938 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 6574 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6574 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:07,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6574 Valid, 2078 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2022-02-20 19:43:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 873. [2022-02-20 19:43:07,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:07,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1151 states. Second operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:07,973 INFO L74 IsIncluded]: Start isIncluded. First operand 1151 states. Second operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:07,975 INFO L87 Difference]: Start difference. First operand 1151 states. Second operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:08,016 INFO L93 Difference]: Finished difference Result 1151 states and 2036 transitions. [2022-02-20 19:43:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2036 transitions. [2022-02-20 19:43:08,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:08,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:08,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 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 1151 states. [2022-02-20 19:43:08,021 INFO L87 Difference]: Start difference. First operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 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 1151 states. [2022-02-20 19:43:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:08,065 INFO L93 Difference]: Finished difference Result 1151 states and 2036 transitions. [2022-02-20 19:43:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2036 transitions. [2022-02-20 19:43:08,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:08,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:08,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:08,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1609 transitions. [2022-02-20 19:43:08,095 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1609 transitions. Word has length 52 [2022-02-20 19:43:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:08,097 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1609 transitions. [2022-02-20 19:43:08,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1609 transitions. [2022-02-20 19:43:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:08,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:08,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:08,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:43:08,098 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -524152242, now seen corresponding path program 1 times [2022-02-20 19:43:08,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:08,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824648565] [2022-02-20 19:43:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:08,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {13080#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {13080#true} is VALID [2022-02-20 19:43:08,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {13080#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {13080#true} is VALID [2022-02-20 19:43:08,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {13080#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {13080#true} is VALID [2022-02-20 19:43:08,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {13080#true} assume 0 == ~r1~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {13082#(<= ~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; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {13082#(<= ~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; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {13082#(<= ~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; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {13082#(<= ~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; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {13082#(<= ~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; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {13082#(<= ~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; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:08,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {13081#false} is VALID [2022-02-20 19:43:08,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {13081#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {13081#false} is VALID [2022-02-20 19:43:08,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {13081#false} check_#res#1 := check_~tmp~1#1; {13081#false} is VALID [2022-02-20 19:43:08,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {13081#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {13081#false} is VALID [2022-02-20 19:43:08,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {13081#false} assume 0 == assert_~arg#1 % 256; {13081#false} is VALID [2022-02-20 19:43:08,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {13081#false} assume !false; {13081#false} is VALID [2022-02-20 19:43:08,238 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:43:08,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:08,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824648565] [2022-02-20 19:43:08,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824648565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:08,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:08,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:08,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720375521] [2022-02-20 19:43:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:08,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:08,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:08,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:08,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:08,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:08,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:08,294 INFO L87 Difference]: Start difference. First operand 873 states and 1609 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:09,674 INFO L93 Difference]: Finished difference Result 1042 states and 1872 transitions. [2022-02-20 19:43:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:09,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2022-02-20 19:43:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2022-02-20 19:43:09,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1675 transitions. [2022-02-20 19:43:11,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:11,072 INFO L225 Difference]: With dead ends: 1042 [2022-02-20 19:43:11,072 INFO L226 Difference]: Without dead ends: 952 [2022-02-20 19:43:11,072 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:43:11,073 INFO L933 BasicCegarLoop]: 1536 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1601 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:43:11,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 1601 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-02-20 19:43:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2022-02-20 19:43:11,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:11,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 952 states. Second operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:11,126 INFO L74 IsIncluded]: Start isIncluded. First operand 952 states. Second operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:11,127 INFO L87 Difference]: Start difference. First operand 952 states. Second operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:11,159 INFO L93 Difference]: Finished difference Result 952 states and 1726 transitions. [2022-02-20 19:43:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1726 transitions. [2022-02-20 19:43:11,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:11,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:11,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 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 952 states. [2022-02-20 19:43:11,175 INFO L87 Difference]: Start difference. First operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 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 952 states. [2022-02-20 19:43:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:11,205 INFO L93 Difference]: Finished difference Result 952 states and 1726 transitions. [2022-02-20 19:43:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1726 transitions. [2022-02-20 19:43:11,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:11,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:11,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:11,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1723 transitions. [2022-02-20 19:43:11,237 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1723 transitions. Word has length 54 [2022-02-20 19:43:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:11,238 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1723 transitions. [2022-02-20 19:43:11,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1723 transitions. [2022-02-20 19:43:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:11,238 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:11,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:11,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:43:11,239 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash -457658730, now seen corresponding path program 1 times [2022-02-20 19:43:11,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:11,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136739260] [2022-02-20 19:43:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:11,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {17059#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {17059#true} is VALID [2022-02-20 19:43:11,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {17059#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {17059#true} is VALID [2022-02-20 19:43:11,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {17059#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {17059#true} is VALID [2022-02-20 19:43:11,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {17059#true} assume 0 == ~r1~0 % 256; {17059#true} is VALID [2022-02-20 19:43:11,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {17059#true} assume ~id1~0 >= 0; {17059#true} is VALID [2022-02-20 19:43:11,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {17059#true} assume 0 == ~st1~0; {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:11,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:11,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:11,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:11,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:11,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:11,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:11,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:11,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:11,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:11,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:11,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:11,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == assume_abort_if_not_~cond#1); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:11,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {17060#false} is VALID [2022-02-20 19:43:11,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {17060#false} check_#res#1 := check_~tmp~1#1; {17060#false} is VALID [2022-02-20 19:43:11,394 INFO L290 TraceCheckUtils]: 51: Hoare triple {17060#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {17060#false} is VALID [2022-02-20 19:43:11,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {17060#false} assume 0 == assert_~arg#1 % 256; {17060#false} is VALID [2022-02-20 19:43:11,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {17060#false} assume !false; {17060#false} is VALID [2022-02-20 19:43:11,395 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:43:11,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:11,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136739260] [2022-02-20 19:43:11,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136739260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:11,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:11,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:43:11,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753030965] [2022-02-20 19:43:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:11,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:11,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:11,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:11,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:11,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:11,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:11,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:11,432 INFO L87 Difference]: Start difference. First operand 948 states and 1723 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:14,504 INFO L93 Difference]: Finished difference Result 1115 states and 1979 transitions. [2022-02-20 19:43:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:43:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2022-02-20 19:43:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2022-02-20 19:43:14,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1682 transitions. [2022-02-20 19:43:15,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1682 edges. 1682 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:15,841 INFO L225 Difference]: With dead ends: 1115 [2022-02-20 19:43:15,841 INFO L226 Difference]: Without dead ends: 950 [2022-02-20 19:43:15,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:43:15,842 INFO L933 BasicCegarLoop]: 1540 mSDtfsCounter, 4563 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4563 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:15,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4563 Valid, 1747 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-02-20 19:43:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2022-02-20 19:43:15,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:15,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 950 states. Second operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:15,904 INFO L74 IsIncluded]: Start isIncluded. First operand 950 states. Second operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:15,904 INFO L87 Difference]: Start difference. First operand 950 states. Second operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:15,931 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2022-02-20 19:43:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1722 transitions. [2022-02-20 19:43:15,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:15,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:15,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 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 950 states. [2022-02-20 19:43:15,934 INFO L87 Difference]: Start difference. First operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 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 950 states. [2022-02-20 19:43:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:15,962 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2022-02-20 19:43:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1722 transitions. [2022-02-20 19:43:15,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:15,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:15,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:15,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1721 transitions. [2022-02-20 19:43:15,993 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1721 transitions. Word has length 54 [2022-02-20 19:43:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:15,993 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1721 transitions. [2022-02-20 19:43:15,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1721 transitions. [2022-02-20 19:43:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:15,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:15,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:15,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:43:15,994 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:15,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1331255346, now seen corresponding path program 1 times [2022-02-20 19:43:15,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:15,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744194255] [2022-02-20 19:43:15,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:15,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:16,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {21127#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {21127#true} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {21127#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {21127#true} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {21127#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21127#true} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {21127#true} assume 0 == ~r1~0 % 256; {21127#true} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {21127#true} assume ~id1~0 >= 0; {21127#true} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {21127#true} assume 0 == ~st1~0; {21127#true} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {21127#true} assume ~send1~0 == ~id1~0; {21127#true} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {21127#true} assume 0 == ~mode1~0 % 256; {21127#true} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {21127#true} assume ~id2~0 >= 0; {21127#true} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#true} assume 0 == ~st2~0; {21127#true} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#true} assume ~send2~0 == ~id2~0; {21127#true} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {21127#true} assume 0 == ~mode2~0 % 256; {21127#true} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {21127#true} assume ~id3~0 >= 0; {21127#true} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {21127#true} assume 0 == ~st3~0; {21127#true} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {21127#true} assume ~send3~0 == ~id3~0; {21127#true} is VALID [2022-02-20 19:43:16,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {21127#true} assume 0 == ~mode3~0 % 256; {21127#true} is VALID [2022-02-20 19:43:16,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {21127#true} assume ~id4~0 >= 0; {21127#true} is VALID [2022-02-20 19:43:16,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {21127#true} assume 0 == ~st4~0; {21127#true} is VALID [2022-02-20 19:43:16,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {21127#true} assume ~send4~0 == ~id4~0; {21127#true} is VALID [2022-02-20 19:43:16,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {21127#true} assume 0 == ~mode4~0 % 256; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,043 INFO L290 TraceCheckUtils]: 42: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:16,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21128#false} is VALID [2022-02-20 19:43:16,044 INFO L290 TraceCheckUtils]: 44: Hoare triple {21128#false} assume node4_~m4~0#1 != ~nomsg~0; {21128#false} is VALID [2022-02-20 19:43:16,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {21128#false} assume !(node4_~m4~0#1 > ~id4~0); {21128#false} is VALID [2022-02-20 19:43:16,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {21128#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {21128#false} is VALID [2022-02-20 19:43:16,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {21128#false} ~mode4~0 := 0; {21128#false} is VALID [2022-02-20 19:43:16,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {21128#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21128#false} is VALID [2022-02-20 19:43:16,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {21128#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {21128#false} is VALID [2022-02-20 19:43:16,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {21128#false} check_#res#1 := check_~tmp~1#1; {21128#false} is VALID [2022-02-20 19:43:16,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {21128#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {21128#false} is VALID [2022-02-20 19:43:16,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {21128#false} assume 0 == assert_~arg#1 % 256; {21128#false} is VALID [2022-02-20 19:43:16,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {21128#false} assume !false; {21128#false} is VALID [2022-02-20 19:43:16,046 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:43:16,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:16,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744194255] [2022-02-20 19:43:16,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744194255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:16,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:16,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:16,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154684160] [2022-02-20 19:43:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:16,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:16,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:16,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:16,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:16,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:16,078 INFO L87 Difference]: Start difference. First operand 948 states and 1721 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:17,717 INFO L93 Difference]: Finished difference Result 1254 states and 2187 transitions. [2022-02-20 19:43:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:17,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:17,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:19,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:19,070 INFO L225 Difference]: With dead ends: 1254 [2022-02-20 19:43:19,070 INFO L226 Difference]: Without dead ends: 1089 [2022-02-20 19:43:19,070 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:43:19,071 INFO L933 BasicCegarLoop]: 1557 mSDtfsCounter, 1489 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1639 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:43:19,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1489 Valid, 1639 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-02-20 19:43:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2022-02-20 19:43:19,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:19,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1089 states. Second operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,162 INFO L74 IsIncluded]: Start isIncluded. First operand 1089 states. Second operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,163 INFO L87 Difference]: Start difference. First operand 1089 states. Second operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:19,197 INFO L93 Difference]: Finished difference Result 1089 states and 1930 transitions. [2022-02-20 19:43:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1930 transitions. [2022-02-20 19:43:19,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:19,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:19,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 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 1089 states. [2022-02-20 19:43:19,202 INFO L87 Difference]: Start difference. First operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 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 1089 states. [2022-02-20 19:43:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:19,237 INFO L93 Difference]: Finished difference Result 1089 states and 1930 transitions. [2022-02-20 19:43:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1930 transitions. [2022-02-20 19:43:19,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:19,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:19,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:19,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1929 transitions. [2022-02-20 19:43:19,276 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1929 transitions. Word has length 54 [2022-02-20 19:43:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:19,276 INFO L470 AbstractCegarLoop]: Abstraction has 1087 states and 1929 transitions. [2022-02-20 19:43:19,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1929 transitions. [2022-02-20 19:43:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:19,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:19,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:19,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:43:19,278 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1716204334, now seen corresponding path program 1 times [2022-02-20 19:43:19,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:19,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854677546] [2022-02-20 19:43:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:19,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {25798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {25798#true} is VALID [2022-02-20 19:43:19,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {25798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {25798#true} is VALID [2022-02-20 19:43:19,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {25798#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {25798#true} is VALID [2022-02-20 19:43:19,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {25798#true} assume 0 == ~r1~0 % 256; {25798#true} is VALID [2022-02-20 19:43:19,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {25798#true} assume ~id1~0 >= 0; {25798#true} is VALID [2022-02-20 19:43:19,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {25798#true} assume 0 == ~st1~0; {25798#true} is VALID [2022-02-20 19:43:19,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {25798#true} assume ~send1~0 == ~id1~0; {25798#true} is VALID [2022-02-20 19:43:19,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {25798#true} assume 0 == ~mode1~0 % 256; {25798#true} is VALID [2022-02-20 19:43:19,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {25798#true} assume ~id2~0 >= 0; {25798#true} is VALID [2022-02-20 19:43:19,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {25798#true} assume 0 == ~st2~0; {25798#true} is VALID [2022-02-20 19:43:19,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {25798#true} assume ~send2~0 == ~id2~0; {25798#true} is VALID [2022-02-20 19:43:19,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {25798#true} assume 0 == ~mode2~0 % 256; {25798#true} is VALID [2022-02-20 19:43:19,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {25798#true} assume ~id3~0 >= 0; {25798#true} is VALID [2022-02-20 19:43:19,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {25798#true} assume 0 == ~st3~0; {25798#true} is VALID [2022-02-20 19:43:19,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {25798#true} assume ~send3~0 == ~id3~0; {25798#true} is VALID [2022-02-20 19:43:19,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {25798#true} assume 0 == ~mode3~0 % 256; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {25800#(= (+ (* (- 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; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {25800#(= (+ (* (- 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; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {25800#(= (+ (* (- 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; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {25800#(= (+ (* (- 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; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {25800#(= (+ (* (- 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; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:19,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {25800#(= (+ (* (- 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; {25799#false} is VALID [2022-02-20 19:43:19,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {25799#false} assume node3_~m3~0#1 != ~nomsg~0; {25799#false} is VALID [2022-02-20 19:43:19,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {25799#false} assume !(node3_~m3~0#1 > ~id3~0); {25799#false} is VALID [2022-02-20 19:43:19,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {25799#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {25799#false} is VALID [2022-02-20 19:43:19,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {25799#false} ~mode3~0 := 0; {25799#false} is VALID [2022-02-20 19:43:19,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {25799#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {25799#false} is VALID [2022-02-20 19:43:19,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {25799#false} assume !(0 != ~mode4~0 % 256); {25799#false} is VALID [2022-02-20 19:43:19,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {25799#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {25799#false} is VALID [2022-02-20 19:43:19,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {25799#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {25799#false} is VALID [2022-02-20 19:43:19,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {25799#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25799#false} is VALID [2022-02-20 19:43:19,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {25799#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {25799#false} is VALID [2022-02-20 19:43:19,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {25799#false} check_#res#1 := check_~tmp~1#1; {25799#false} is VALID [2022-02-20 19:43:19,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {25799#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {25799#false} is VALID [2022-02-20 19:43:19,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {25799#false} assume 0 == assert_~arg#1 % 256; {25799#false} is VALID [2022-02-20 19:43:19,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {25799#false} assume !false; {25799#false} is VALID [2022-02-20 19:43:19,348 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:43:19,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:19,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854677546] [2022-02-20 19:43:19,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854677546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:19,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:19,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:19,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455805799] [2022-02-20 19:43:19,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:19,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:19,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:19,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:19,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:19,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:19,377 INFO L87 Difference]: Start difference. First operand 1087 states and 1929 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:21,116 INFO L93 Difference]: Finished difference Result 1647 states and 2771 transitions. [2022-02-20 19:43:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:21,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:21,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:22,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:22,458 INFO L225 Difference]: With dead ends: 1647 [2022-02-20 19:43:22,458 INFO L226 Difference]: Without dead ends: 1343 [2022-02-20 19:43:22,459 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:43:22,459 INFO L933 BasicCegarLoop]: 1570 mSDtfsCounter, 1493 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1648 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:43:22,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1493 Valid, 1648 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-02-20 19:43:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1341. [2022-02-20 19:43:22,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:22,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1343 states. Second operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,647 INFO L74 IsIncluded]: Start isIncluded. First operand 1343 states. Second operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,648 INFO L87 Difference]: Start difference. First operand 1343 states. Second operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:22,695 INFO L93 Difference]: Finished difference Result 1343 states and 2302 transitions. [2022-02-20 19:43:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2302 transitions. [2022-02-20 19:43:22,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:22,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:22,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 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 1343 states. [2022-02-20 19:43:22,699 INFO L87 Difference]: Start difference. First operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 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 1343 states. [2022-02-20 19:43:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:22,747 INFO L93 Difference]: Finished difference Result 1343 states and 2302 transitions. [2022-02-20 19:43:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2302 transitions. [2022-02-20 19:43:22,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:22,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:22,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:22,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2301 transitions. [2022-02-20 19:43:22,802 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2301 transitions. Word has length 54 [2022-02-20 19:43:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:22,802 INFO L470 AbstractCegarLoop]: Abstraction has 1341 states and 2301 transitions. [2022-02-20 19:43:22,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2301 transitions. [2022-02-20 19:43:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:22,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:22,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, 1, 1, 1, 1, 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:43:22,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:43:22,803 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1442516622, now seen corresponding path program 1 times [2022-02-20 19:43:22,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:22,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660090341] [2022-02-20 19:43:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:22,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:22,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {31759#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {31759#true} is VALID [2022-02-20 19:43:22,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {31759#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {31759#true} is VALID [2022-02-20 19:43:22,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {31759#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {31759#true} is VALID [2022-02-20 19:43:22,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {31759#true} assume 0 == ~r1~0 % 256; {31759#true} is VALID [2022-02-20 19:43:22,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {31759#true} assume ~id1~0 >= 0; {31759#true} is VALID [2022-02-20 19:43:22,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {31759#true} assume 0 == ~st1~0; {31759#true} is VALID [2022-02-20 19:43:22,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {31759#true} assume ~send1~0 == ~id1~0; {31759#true} is VALID [2022-02-20 19:43:22,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {31759#true} assume 0 == ~mode1~0 % 256; {31759#true} is VALID [2022-02-20 19:43:22,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {31759#true} assume ~id2~0 >= 0; {31759#true} is VALID [2022-02-20 19:43:22,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {31759#true} assume 0 == ~st2~0; {31759#true} is VALID [2022-02-20 19:43:22,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {31759#true} assume ~send2~0 == ~id2~0; {31759#true} is VALID [2022-02-20 19:43:22,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {31759#true} assume 0 == ~mode2~0 % 256; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {31761#(= (+ (* (- 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; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {31761#(= (+ (* (- 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; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {31761#(= (+ (* (- 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; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:22,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {31761#(= (+ (* (- 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; {31760#false} is VALID [2022-02-20 19:43:22,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {31760#false} assume node2_~m2~0#1 != ~nomsg~0; {31760#false} is VALID [2022-02-20 19:43:22,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {31760#false} assume !(node2_~m2~0#1 > ~id2~0); {31760#false} is VALID [2022-02-20 19:43:22,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {31760#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {31760#false} is VALID [2022-02-20 19:43:22,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {31760#false} ~mode2~0 := 0; {31760#false} is VALID [2022-02-20 19:43:22,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {31760#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; {31760#false} is VALID [2022-02-20 19:43:22,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {31760#false} assume !(0 != ~mode3~0 % 256); {31760#false} is VALID [2022-02-20 19:43:22,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {31760#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {31760#false} is VALID [2022-02-20 19:43:22,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {31760#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; {31760#false} is VALID [2022-02-20 19:43:22,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {31760#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {31760#false} is VALID [2022-02-20 19:43:22,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {31760#false} assume !(0 != ~mode4~0 % 256); {31760#false} is VALID [2022-02-20 19:43:22,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {31760#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {31760#false} is VALID [2022-02-20 19:43:22,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {31760#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {31760#false} is VALID [2022-02-20 19:43:22,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {31760#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {31760#false} is VALID [2022-02-20 19:43:22,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {31760#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {31760#false} is VALID [2022-02-20 19:43:22,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {31760#false} check_#res#1 := check_~tmp~1#1; {31760#false} is VALID [2022-02-20 19:43:22,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {31760#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {31760#false} is VALID [2022-02-20 19:43:22,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {31760#false} assume 0 == assert_~arg#1 % 256; {31760#false} is VALID [2022-02-20 19:43:22,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {31760#false} assume !false; {31760#false} is VALID [2022-02-20 19:43:22,864 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:43:22,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:22,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660090341] [2022-02-20 19:43:22,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660090341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:22,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:22,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:22,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486191715] [2022-02-20 19:43:22,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:22,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:22,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:22,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:22,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:22,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:22,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:22,894 INFO L87 Difference]: Start difference. First operand 1341 states and 2301 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:24,901 INFO L93 Difference]: Finished difference Result 2361 states and 3807 transitions. [2022-02-20 19:43:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:24,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:24,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:26,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:26,297 INFO L225 Difference]: With dead ends: 2361 [2022-02-20 19:43:26,297 INFO L226 Difference]: Without dead ends: 1803 [2022-02-20 19:43:26,298 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:43:26,298 INFO L933 BasicCegarLoop]: 1583 mSDtfsCounter, 1497 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1657 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:43:26,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1497 Valid, 1657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-02-20 19:43:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2022-02-20 19:43:26,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:26,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1803 states. Second operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:26,607 INFO L74 IsIncluded]: Start isIncluded. First operand 1803 states. Second operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:26,609 INFO L87 Difference]: Start difference. First operand 1803 states. Second operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:26,703 INFO L93 Difference]: Finished difference Result 1803 states and 2958 transitions. [2022-02-20 19:43:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2958 transitions. [2022-02-20 19:43:26,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:26,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:26,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 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 1803 states. [2022-02-20 19:43:26,708 INFO L87 Difference]: Start difference. First operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 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 1803 states. [2022-02-20 19:43:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:26,797 INFO L93 Difference]: Finished difference Result 1803 states and 2958 transitions. [2022-02-20 19:43:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2958 transitions. [2022-02-20 19:43:26,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:26,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:26,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:26,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2957 transitions. [2022-02-20 19:43:26,903 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2957 transitions. Word has length 54 [2022-02-20 19:43:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:26,903 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2957 transitions. [2022-02-20 19:43:26,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2957 transitions. [2022-02-20 19:43:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:43:26,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:26,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:26,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:43:26,904 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1717241860, now seen corresponding path program 1 times [2022-02-20 19:43:26,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:26,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470285373] [2022-02-20 19:43:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:26,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {40084#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {40084#true} is VALID [2022-02-20 19:43:26,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {40084#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {40084#true} is VALID [2022-02-20 19:43:26,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {40084#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40084#true} is VALID [2022-02-20 19:43:26,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {40084#true} assume 0 == ~r1~0 % 256; {40084#true} is VALID [2022-02-20 19:43:26,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {40084#true} assume ~id1~0 >= 0; {40084#true} is VALID [2022-02-20 19:43:26,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {40084#true} assume 0 == ~st1~0; {40084#true} is VALID [2022-02-20 19:43:26,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {40084#true} assume ~send1~0 == ~id1~0; {40084#true} is VALID [2022-02-20 19:43:26,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {40084#true} assume 0 == ~mode1~0 % 256; {40084#true} is VALID [2022-02-20 19:43:26,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {40084#true} assume ~id2~0 >= 0; {40084#true} is VALID [2022-02-20 19:43:26,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {40084#true} assume 0 == ~st2~0; {40084#true} is VALID [2022-02-20 19:43:26,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {40084#true} assume ~send2~0 == ~id2~0; {40084#true} is VALID [2022-02-20 19:43:26,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {40084#true} assume 0 == ~mode2~0 % 256; {40084#true} is VALID [2022-02-20 19:43:26,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {40084#true} assume ~id3~0 >= 0; {40084#true} is VALID [2022-02-20 19:43:26,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {40084#true} assume 0 == ~st3~0; {40084#true} is VALID [2022-02-20 19:43:26,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {40084#true} assume ~send3~0 == ~id3~0; {40084#true} is VALID [2022-02-20 19:43:26,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {40084#true} assume 0 == ~mode3~0 % 256; {40084#true} is VALID [2022-02-20 19:43:26,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {40084#true} assume ~id4~0 >= 0; {40084#true} is VALID [2022-02-20 19:43:26,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {40084#true} assume 0 == ~st4~0; {40084#true} is VALID [2022-02-20 19:43:26,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {40084#true} assume ~send4~0 == ~id4~0; {40084#true} is VALID [2022-02-20 19:43:26,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {40084#true} assume 0 == ~mode4~0 % 256; {40084#true} is VALID [2022-02-20 19:43:26,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {40084#true} assume ~id1~0 != ~id2~0; {40084#true} is VALID [2022-02-20 19:43:26,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {40084#true} assume ~id1~0 != ~id3~0; {40084#true} is VALID [2022-02-20 19:43:26,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {40084#true} assume ~id1~0 != ~id4~0; {40084#true} is VALID [2022-02-20 19:43:26,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {40084#true} assume ~id2~0 != ~id3~0; {40084#true} is VALID [2022-02-20 19:43:26,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {40084#true} assume ~id2~0 != ~id4~0; {40084#true} is VALID [2022-02-20 19:43:26,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {40084#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {40086#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:43:26,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {40086#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {40087#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:43:26,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {40087#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {40088#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:43:26,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {40088#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {40084#true} is VALID [2022-02-20 19:43:26,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {40084#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {40084#true} is VALID [2022-02-20 19:43:26,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {40084#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; {40084#true} is VALID [2022-02-20 19:43:26,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {40084#true} assume !(0 != ~mode1~0 % 256); {40084#true} is VALID [2022-02-20 19:43:26,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {40084#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {40084#true} is VALID [2022-02-20 19:43:26,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {40084#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; {40084#true} is VALID [2022-02-20 19:43:26,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {40084#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; {40084#true} is VALID [2022-02-20 19:43:26,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {40084#true} assume !(0 != ~mode2~0 % 256); {40084#true} is VALID [2022-02-20 19:43:26,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {40084#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {40084#true} is VALID [2022-02-20 19:43:26,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {40084#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; {40084#true} is VALID [2022-02-20 19:43:26,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {40084#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; {40084#true} is VALID [2022-02-20 19:43:26,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {40084#true} assume !(0 != ~mode3~0 % 256); {40084#true} is VALID [2022-02-20 19:43:26,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {40084#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {40084#true} is VALID [2022-02-20 19:43:26,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {40084#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; {40084#true} is VALID [2022-02-20 19:43:26,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {40084#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {40084#true} is VALID [2022-02-20 19:43:26,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {40084#true} assume !(0 != ~mode4~0 % 256); {40084#true} is VALID [2022-02-20 19:43:26,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {40084#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {40084#true} is VALID [2022-02-20 19:43:26,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {40084#true} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {40084#true} is VALID [2022-02-20 19:43:26,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {40084#true} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {40084#true} is VALID [2022-02-20 19:43:26,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {40084#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {40084#true} is VALID [2022-02-20 19:43:26,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {40084#true} assume !(~r1~0 % 256 >= 4); {40084#true} is VALID [2022-02-20 19:43:26,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {40084#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {40084#true} is VALID [2022-02-20 19:43:26,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {40084#true} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {40089#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:43:26,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {40089#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {40090#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:43:26,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {40090#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {40091#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:43:26,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {40091#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {40085#false} is VALID [2022-02-20 19:43:26,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {40085#false} assume !false; {40085#false} is VALID [2022-02-20 19:43:26,987 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:43:26,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:26,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470285373] [2022-02-20 19:43:26,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470285373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:26,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:26,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:43:26,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806251043] [2022-02-20 19:43:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:26,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:43:26,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:26,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:27,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:27,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:43:27,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:43:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:43:27,020 INFO L87 Difference]: Start difference. First operand 1801 states and 2957 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:34,072 INFO L93 Difference]: Finished difference Result 2571 states and 4058 transitions. [2022-02-20 19:43:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:43:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:43:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1616 transitions. [2022-02-20 19:43:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1616 transitions. [2022-02-20 19:43:34,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1616 transitions. [2022-02-20 19:43:35,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1616 edges. 1616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:35,361 INFO L225 Difference]: With dead ends: 2571 [2022-02-20 19:43:35,361 INFO L226 Difference]: Without dead ends: 2569 [2022-02-20 19:43:35,362 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:43:35,370 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 498 mSDsluCounter, 9002 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 10579 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:43:35,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 10579 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2022-02-20 19:43:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1849. [2022-02-20 19:43:35,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:35,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2569 states. Second operand has 1849 states, 1847 states have (on average 1.6226312939902545) internal successors, (2997), 1848 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:35,956 INFO L74 IsIncluded]: Start isIncluded. First operand 2569 states. Second operand has 1849 states, 1847 states have (on average 1.6226312939902545) internal successors, (2997), 1848 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:35,957 INFO L87 Difference]: Start difference. First operand 2569 states. Second operand has 1849 states, 1847 states have (on average 1.6226312939902545) internal successors, (2997), 1848 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:36,125 INFO L93 Difference]: Finished difference Result 2569 states and 4033 transitions. [2022-02-20 19:43:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4033 transitions. [2022-02-20 19:43:36,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:36,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:36,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 1849 states, 1847 states have (on average 1.6226312939902545) internal successors, (2997), 1848 states have internal predecessors, (2997), 0 states have call successors, (0), 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 2569 states. [2022-02-20 19:43:36,130 INFO L87 Difference]: Start difference. First operand has 1849 states, 1847 states have (on average 1.6226312939902545) internal successors, (2997), 1848 states have internal predecessors, (2997), 0 states have call successors, (0), 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 2569 states. [2022-02-20 19:43:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:36,302 INFO L93 Difference]: Finished difference Result 2569 states and 4033 transitions. [2022-02-20 19:43:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4033 transitions. [2022-02-20 19:43:36,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:36,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:36,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:36,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1847 states have (on average 1.6226312939902545) internal successors, (2997), 1848 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2997 transitions. [2022-02-20 19:43:36,413 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2997 transitions. Word has length 55 [2022-02-20 19:43:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:36,413 INFO L470 AbstractCegarLoop]: Abstraction has 1849 states and 2997 transitions. [2022-02-20 19:43:36,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2997 transitions. [2022-02-20 19:43:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 19:43:36,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:36,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:36,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:43:36,414 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -754642547, now seen corresponding path program 1 times [2022-02-20 19:43:36,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:36,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043832098] [2022-02-20 19:43:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:36,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {50318#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {50318#true} is VALID [2022-02-20 19:43:36,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {50318#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {50318#true} is VALID [2022-02-20 19:43:36,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {50318#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {50318#true} is VALID [2022-02-20 19:43:36,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {50318#true} assume 0 == ~r1~0 % 256; {50318#true} is VALID [2022-02-20 19:43:36,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {50318#true} assume ~id1~0 >= 0; {50318#true} is VALID [2022-02-20 19:43:36,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {50318#true} assume 0 == ~st1~0; {50318#true} is VALID [2022-02-20 19:43:36,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {50318#true} assume ~send1~0 == ~id1~0; {50318#true} is VALID [2022-02-20 19:43:36,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {50318#true} assume 0 == ~mode1~0 % 256; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {50320#(= (+ (* (- 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; {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:36,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {50320#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {50319#false} is VALID [2022-02-20 19:43:36,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {50319#false} assume !(255 == ~r1~0 % 256); {50319#false} is VALID [2022-02-20 19:43:36,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {50319#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {50319#false} is VALID [2022-02-20 19:43:36,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {50319#false} assume node1_~m1~0#1 != ~nomsg~0; {50319#false} is VALID [2022-02-20 19:43:36,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {50319#false} assume !(node1_~m1~0#1 > ~id1~0); {50319#false} is VALID [2022-02-20 19:43:36,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {50319#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {50319#false} is VALID [2022-02-20 19:43:36,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {50319#false} ~mode1~0 := 0; {50319#false} is VALID [2022-02-20 19:43:36,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {50319#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; {50319#false} is VALID [2022-02-20 19:43:36,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {50319#false} assume !(0 != ~mode2~0 % 256); {50319#false} is VALID [2022-02-20 19:43:36,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {50319#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {50319#false} is VALID [2022-02-20 19:43:36,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {50319#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; {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {50319#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; {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {50319#false} assume !(0 != ~mode3~0 % 256); {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {50319#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {50319#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; {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {50319#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {50319#false} assume !(0 != ~mode4~0 % 256); {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {50319#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {50319#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {50319#false} is VALID [2022-02-20 19:43:36,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {50319#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {50319#false} is VALID [2022-02-20 19:43:36,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {50319#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {50319#false} is VALID [2022-02-20 19:43:36,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {50319#false} check_#res#1 := check_~tmp~1#1; {50319#false} is VALID [2022-02-20 19:43:36,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {50319#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {50319#false} is VALID [2022-02-20 19:43:36,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {50319#false} assume 0 == assert_~arg#1 % 256; {50319#false} is VALID [2022-02-20 19:43:36,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {50319#false} assume !false; {50319#false} is VALID [2022-02-20 19:43:36,476 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:43:36,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:36,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043832098] [2022-02-20 19:43:36,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043832098] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:36,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:36,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:36,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658452888] [2022-02-20 19:43:36,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:36,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 19:43:36,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:36,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:36,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:36,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:36,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:36,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:36,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:36,509 INFO L87 Difference]: Start difference. First operand 1849 states and 2997 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:39,031 INFO L93 Difference]: Finished difference Result 2944 states and 4587 transitions. [2022-02-20 19:43:39,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:39,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 19:43:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1671 transitions. [2022-02-20 19:43:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1671 transitions. [2022-02-20 19:43:39,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1671 transitions. [2022-02-20 19:43:40,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:40,518 INFO L225 Difference]: With dead ends: 2944 [2022-02-20 19:43:40,519 INFO L226 Difference]: Without dead ends: 2333 [2022-02-20 19:43:40,519 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:43:40,520 INFO L933 BasicCegarLoop]: 1591 mSDtfsCounter, 1498 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1661 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:43:40,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1661 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2022-02-20 19:43:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2331. [2022-02-20 19:43:41,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:41,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2333 states. Second operand has 2331 states, 2329 states have (on average 1.5762129669386002) internal successors, (3671), 2330 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:41,249 INFO L74 IsIncluded]: Start isIncluded. First operand 2333 states. Second operand has 2331 states, 2329 states have (on average 1.5762129669386002) internal successors, (3671), 2330 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:41,250 INFO L87 Difference]: Start difference. First operand 2333 states. Second operand has 2331 states, 2329 states have (on average 1.5762129669386002) internal successors, (3671), 2330 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:41,393 INFO L93 Difference]: Finished difference Result 2333 states and 3672 transitions. [2022-02-20 19:43:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3672 transitions. [2022-02-20 19:43:41,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:41,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:41,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 2331 states, 2329 states have (on average 1.5762129669386002) internal successors, (3671), 2330 states have internal predecessors, (3671), 0 states have call successors, (0), 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 2333 states. [2022-02-20 19:43:41,398 INFO L87 Difference]: Start difference. First operand has 2331 states, 2329 states have (on average 1.5762129669386002) internal successors, (3671), 2330 states have internal predecessors, (3671), 0 states have call successors, (0), 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 2333 states. [2022-02-20 19:43:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:41,536 INFO L93 Difference]: Finished difference Result 2333 states and 3672 transitions. [2022-02-20 19:43:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3672 transitions. [2022-02-20 19:43:41,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:41,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:41,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:41,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2331 states, 2329 states have (on average 1.5762129669386002) internal successors, (3671), 2330 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 3671 transitions. [2022-02-20 19:43:41,712 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 3671 transitions. Word has length 56 [2022-02-20 19:43:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:41,712 INFO L470 AbstractCegarLoop]: Abstraction has 2331 states and 3671 transitions. [2022-02-20 19:43:41,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 3671 transitions. [2022-02-20 19:43:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 19:43:41,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:41,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:41,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:43:41,713 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1392228915, now seen corresponding path program 1 times [2022-02-20 19:43:41,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:41,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033853833] [2022-02-20 19:43:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:41,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:41,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {61126#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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; {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet42#1);havoc main_#t~nondet42#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet40#1, main2_#t~ret41#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet40#1 && main2_#t~nondet40#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet40#1;havoc main2_#t~nondet40#1; {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret37#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:43:41,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {61128#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {61129#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:43:41,813 INFO L290 TraceCheckUtils]: 65: Hoare triple {61129#(not (= (+ (- 3) ~a5~0) 0))} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {61127#false} is VALID [2022-02-20 19:43:41,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {61127#false} assume !false; {61127#false} is VALID [2022-02-20 19:43:41,814 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:43:41,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:41,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033853833] [2022-02-20 19:43:41,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033853833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:41,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:41,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:41,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826639576] [2022-02-20 19:43:41,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:41,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 19:43:41,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:41,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:41,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:41,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:43:41,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:43:41,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:43:41,862 INFO L87 Difference]: Start difference. First operand 2331 states and 3671 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)