./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label08.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_label08.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 11f2e72cb8a06a1896873093a1b872fd2dead3c7d91302c62d439cf7642b18a1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:42:42,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:42:42,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:42:42,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:42:42,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:42:42,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:42:42,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:42:42,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:42:42,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:42:42,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:42:42,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:42:42,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:42:42,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:42:42,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:42:42,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:42:42,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:42:42,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:42:42,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:42:42,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:42:42,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:42:42,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:42:42,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:42:42,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:42:42,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:42:42,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:42:42,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:42:42,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:42:42,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:42:42,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:42:42,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:42:42,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:42:42,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:42:42,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:42:42,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:42:42,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:42:42,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:42:42,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:42:42,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:42:42,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:42:42,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:42:42,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:42:42,232 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:42,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:42:42,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:42:42,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:42:42,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:42:42,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:42:42,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:42:42,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:42:42,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:42:42,247 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:42:42,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:42:42,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:42:42,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:42:42,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:42:42,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:42:42,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:42:42,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:42:42,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:42:42,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:42:42,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:42:42,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:42:42,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:42:42,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:42:42,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:42:42,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:42:42,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:42,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:42:42,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:42:42,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:42:42,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:42:42,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:42:42,250 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:42:42,251 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:42:42,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:42:42,251 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 -> 11f2e72cb8a06a1896873093a1b872fd2dead3c7d91302c62d439cf7642b18a1 [2022-02-20 19:42:42,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:42:42,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:42:42,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:42:42,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:42:42,406 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:42:42,407 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_label08.c [2022-02-20 19:42:42,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb7feb8f/bb0f36312ac746d6b902750e8a5c47dc/FLAG19a3813cf [2022-02-20 19:42:43,004 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:42:43,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label08.c [2022-02-20 19:42:43,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb7feb8f/bb0f36312ac746d6b902750e8a5c47dc/FLAG19a3813cf [2022-02-20 19:42:43,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb7feb8f/bb0f36312ac746d6b902750e8a5c47dc [2022-02-20 19:42:43,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:42:43,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:42:43,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:43,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:42:43,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:42:43,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:43" (1/1) ... [2022-02-20 19:42:43,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6f6fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:43, skipping insertion in model container [2022-02-20 19:42:43,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:43" (1/1) ... [2022-02-20 19:42:43,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:42:43,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:42:43,549 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_label08.c[8712,8725] [2022-02-20 19:42:43,592 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_label08.c[12219,12232] [2022-02-20 19:42:44,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:44,112 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:42:44,154 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_label08.c[8712,8725] [2022-02-20 19:42:44,160 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_label08.c[12219,12232] [2022-02-20 19:42:44,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:44,489 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:42:44,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:44 WrapperNode [2022-02-20 19:42:44,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:44,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:44,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:42:44,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:42:44,495 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:44" (1/1) ... [2022-02-20 19:42:44,539 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:44" (1/1) ... [2022-02-20 19:42:44,841 INFO L137 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5031 [2022-02-20 19:42:44,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:44,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:42:44,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:42:44,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:42:44,848 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:44" (1/1) ... [2022-02-20 19:42:44,848 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:44" (1/1) ... [2022-02-20 19:42:44,880 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:44" (1/1) ... [2022-02-20 19:42:44,881 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:44" (1/1) ... [2022-02-20 19:42:45,035 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:44" (1/1) ... [2022-02-20 19:42:45,072 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:44" (1/1) ... [2022-02-20 19:42:45,087 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:44" (1/1) ... [2022-02-20 19:42:45,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:42:45,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:42:45,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:42:45,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:42:45,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:44" (1/1) ... [2022-02-20 19:42:45,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:42:45,182 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:45,200 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:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:42:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:42:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:42:45,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:42:45,337 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:42:45,338 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:42:51,577 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:42:51,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:42:51,587 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:42:51,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:51 BoogieIcfgContainer [2022-02-20 19:42:51,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:42:51,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:42:51,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:42:51,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:42:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:42:43" (1/3) ... [2022-02-20 19:42:51,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6624069e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:51, skipping insertion in model container [2022-02-20 19:42:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:44" (2/3) ... [2022-02-20 19:42:51,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6624069e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:51, skipping insertion in model container [2022-02-20 19:42:51,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:51" (3/3) ... [2022-02-20 19:42:51,595 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label08.c [2022-02-20 19:42:51,598 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:42:51,598 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:42:51,629 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:42:51,633 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:51,633 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:42:51,659 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:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:51,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:51,664 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:51,665 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:51,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2085104645, now seen corresponding path program 1 times [2022-02-20 19:42:51,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:51,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220800176] [2022-02-20 19:42:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:51,807 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:51,807 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:51,807 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:51,808 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:51,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {898#true} init_#res#1 := init_~tmp~0#1; {898#true} is VALID [2022-02-20 19:42:51,808 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:51,809 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:51,809 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:51,809 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:51,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {899#false} assume !(0 != ~mode1~0 % 256); {899#false} is VALID [2022-02-20 19:42:51,810 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:51,810 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:51,810 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:51,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {899#false} assume !(0 != ~mode2~0 % 256); {899#false} is VALID [2022-02-20 19:42:51,810 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:51,811 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:51,811 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:51,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {899#false} assume !(0 != ~mode3~0 % 256); {899#false} is VALID [2022-02-20 19:42:51,811 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:51,811 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:51,812 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:51,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {899#false} assume !(0 != ~mode4~0 % 256); {899#false} is VALID [2022-02-20 19:42:51,812 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:51,812 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:51,812 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:51,813 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:51,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {899#false} check_#res#1 := check_~tmp~1#1; {899#false} is VALID [2022-02-20 19:42:51,813 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:51,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {899#false} assume 0 == assert_~arg#1 % 256; {899#false} is VALID [2022-02-20 19:42:51,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {899#false} assume !false; {899#false} is VALID [2022-02-20 19:42:51,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:42:51,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:51,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220800176] [2022-02-20 19:42:51,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220800176] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:51,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:51,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:42:51,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377585416] [2022-02-20 19:42:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:51,820 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:51,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:51,822 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:51,851 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:51,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:42:51,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:51,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:42:51,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:42:51,869 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:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:53,143 INFO L93 Difference]: Finished difference Result 1759 states and 3336 transitions. [2022-02-20 19:42:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:42:53,143 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:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:53,144 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:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3336 transitions. [2022-02-20 19:42:53,170 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:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3336 transitions. [2022-02-20 19:42:53,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3336 transitions. [2022-02-20 19:42:55,606 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:55,693 INFO L225 Difference]: With dead ends: 1759 [2022-02-20 19:42:55,693 INFO L226 Difference]: Without dead ends: 829 [2022-02-20 19:42:55,698 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:55,700 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:55,700 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:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-02-20 19:42:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2022-02-20 19:42:55,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:55,783 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:55,786 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:55,794 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:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:55,828 INFO L93 Difference]: Finished difference Result 829 states and 1563 transitions. [2022-02-20 19:42:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:55,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:55,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:55,838 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:55,840 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:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:55,869 INFO L93 Difference]: Finished difference Result 829 states and 1563 transitions. [2022-02-20 19:42:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:55,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:55,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:55,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:55,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:55,875 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:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1563 transitions. [2022-02-20 19:42:55,903 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1563 transitions. Word has length 30 [2022-02-20 19:42:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:55,908 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1563 transitions. [2022-02-20 19:42:55,908 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:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:55,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:55,909 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:55,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:42:55,910 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:55,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1951091139, now seen corresponding path program 1 times [2022-02-20 19:42:55,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:55,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301562893] [2022-02-20 19:42:55,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:55,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:56,014 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:56,014 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:56,014 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:56,015 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:56,015 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:56,016 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:56,016 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:56,016 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:56,017 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:56,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {5190#false} assume !(0 != ~mode1~0 % 256); {5190#false} is VALID [2022-02-20 19:42:56,017 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:56,017 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:56,017 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:56,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {5190#false} assume !(0 != ~mode2~0 % 256); {5190#false} is VALID [2022-02-20 19:42:56,018 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:56,018 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:56,018 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:56,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {5190#false} assume !(0 != ~mode3~0 % 256); {5190#false} is VALID [2022-02-20 19:42:56,018 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:56,018 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:56,019 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:56,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {5190#false} assume !(0 != ~mode4~0 % 256); {5190#false} is VALID [2022-02-20 19:42:56,019 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:56,019 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:56,019 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:56,020 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:56,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {5190#false} check_#res#1 := check_~tmp~1#1; {5190#false} is VALID [2022-02-20 19:42:56,020 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:56,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {5190#false} assume 0 == assert_~arg#1 % 256; {5190#false} is VALID [2022-02-20 19:42:56,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {5190#false} assume !false; {5190#false} is VALID [2022-02-20 19:42:56,020 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:56,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:56,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301562893] [2022-02-20 19:42:56,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301562893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:56,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:56,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:42:56,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440031505] [2022-02-20 19:42:56,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:56,022 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:56,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:56,023 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:56,039 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:56,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:42:56,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:56,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:42:56,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:42:56,040 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:42:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:59,840 INFO L93 Difference]: Finished difference Result 879 states and 1639 transitions. [2022-02-20 19:42:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:42:59,840 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:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:59,841 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:42:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2022-02-20 19:42:59,852 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:42:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2022-02-20 19:42:59,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1639 transitions. [2022-02-20 19:43:01,131 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:01,156 INFO L225 Difference]: With dead ends: 879 [2022-02-20 19:43:01,156 INFO L226 Difference]: Without dead ends: 829 [2022-02-20 19:43:01,159 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:01,161 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:01,162 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:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-02-20 19:43:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2022-02-20 19:43:01,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:01,178 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:01,180 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:01,183 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:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:01,210 INFO L93 Difference]: Finished difference Result 829 states and 1540 transitions. [2022-02-20 19:43:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:43:01,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:01,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:01,214 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:01,216 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:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:01,251 INFO L93 Difference]: Finished difference Result 829 states and 1540 transitions. [2022-02-20 19:43:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:43:01,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:01,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:01,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:01,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:01,256 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:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1540 transitions. [2022-02-20 19:43:01,293 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1540 transitions. Word has length 30 [2022-02-20 19:43:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:01,293 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1540 transitions. [2022-02-20 19:43:01,294 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:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:43:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:43:01,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:01,295 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:43:01,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:43:01,296 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1553768851, now seen corresponding path program 1 times [2022-02-20 19:43:01,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:01,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194173498] [2022-02-20 19:43:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:01,396 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; {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {8602#(<= 15 ~a24~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; {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {8602#(<= 15 ~a24~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; {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {8602#(<= 15 ~a24~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; {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {8602#(<= 15 ~a24~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; {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {8602#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8602#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:01,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {8602#(<= 15 ~a24~0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8601#false} is VALID [2022-02-20 19:43:01,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#false} assume !false; {8601#false} is VALID [2022-02-20 19:43:01,412 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:01,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:01,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194173498] [2022-02-20 19:43:01,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194173498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:01,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:01,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:43:01,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053492995] [2022-02-20 19:43:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:01,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.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:43:01,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:01,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.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:43:01,433 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:43:01,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:01,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:01,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:01,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:01,435 INFO L87 Difference]: Start difference. First operand 829 states and 1540 transitions. Second operand has 3 states, 3 states have (on average 10.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:43:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:06,453 INFO L93 Difference]: Finished difference Result 2333 states and 4413 transitions. [2022-02-20 19:43:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:06,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.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:43:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.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:43:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4413 transitions. [2022-02-20 19:43:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.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:43:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4413 transitions. [2022-02-20 19:43:06,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4413 transitions. [2022-02-20 19:43:10,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4413 edges. 4413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:10,186 INFO L225 Difference]: With dead ends: 2333 [2022-02-20 19:43:10,187 INFO L226 Difference]: Without dead ends: 1580 [2022-02-20 19:43:10,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:10,188 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 889 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:10,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [889 Valid, 529 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 19:43:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2022-02-20 19:43:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2022-02-20 19:43:10,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:10,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.626742712294043) internal successors, (2567), 1579 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call 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:10,213 INFO L74 IsIncluded]: Start isIncluded. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.626742712294043) internal successors, (2567), 1579 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call 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:10,215 INFO L87 Difference]: Start difference. First operand 1580 states. Second operand has 1580 states, 1578 states have (on average 1.626742712294043) internal successors, (2567), 1579 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call 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:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:10,291 INFO L93 Difference]: Finished difference Result 1580 states and 2567 transitions. [2022-02-20 19:43:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2567 transitions. [2022-02-20 19:43:10,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:10,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:10,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 1580 states, 1578 states have (on average 1.626742712294043) internal successors, (2567), 1579 states have internal predecessors, (2567), 0 states have call successors, (0), 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 1580 states. [2022-02-20 19:43:10,299 INFO L87 Difference]: Start difference. First operand has 1580 states, 1578 states have (on average 1.626742712294043) internal successors, (2567), 1579 states have internal predecessors, (2567), 0 states have call successors, (0), 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 1580 states. [2022-02-20 19:43:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:10,371 INFO L93 Difference]: Finished difference Result 1580 states and 2567 transitions. [2022-02-20 19:43:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2567 transitions. [2022-02-20 19:43:10,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:10,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:10,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:10,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1578 states have (on average 1.626742712294043) internal successors, (2567), 1579 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call 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:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2567 transitions. [2022-02-20 19:43:10,454 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2567 transitions. Word has length 30 [2022-02-20 19:43:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:10,455 INFO L470 AbstractCegarLoop]: Abstraction has 1580 states and 2567 transitions. [2022-02-20 19:43:10,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.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:43:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2567 transitions. [2022-02-20 19:43:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:10,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:10,456 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:10,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:43:10,456 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 568524862, now seen corresponding path program 1 times [2022-02-20 19:43:10,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:10,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260157865] [2022-02-20 19:43:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:10,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {15719#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; {15719#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {15719#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; {15719#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {15719#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; {15719#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {15719#true} assume 0 == ~r1~0 % 256; {15719#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {15719#true} assume ~id1~0 >= 0; {15719#true} is VALID [2022-02-20 19:43:10,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {15719#true} assume 0 == ~st1~0; {15721#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:10,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {15721#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {15721#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:10,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {15721#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {15721#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:10,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {15721#(<= ~st1~0 0)} assume ~id2~0 >= 0; {15721#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:10,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {15721#(<= ~st1~0 0)} assume 0 == ~st2~0; {15722#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {15722#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {15722#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {15722#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15722#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {15722#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {15722#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {15722#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {15723#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {15723#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {15723#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {15723#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15723#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {15723#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {15723#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {15723#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {15724#(<= (+ ~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; {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:10,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {15724#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {15720#false} is VALID [2022-02-20 19:43:10,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {15720#false} check_#res#1 := check_~tmp~1#1; {15720#false} is VALID [2022-02-20 19:43:10,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {15720#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; {15720#false} is VALID [2022-02-20 19:43:10,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {15720#false} assume 0 == assert_~arg#1 % 256; {15720#false} is VALID [2022-02-20 19:43:10,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {15720#false} assume !false; {15720#false} is VALID [2022-02-20 19:43:10,619 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:10,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:10,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260157865] [2022-02-20 19:43:10,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260157865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:10,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:10,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:43:10,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405670328] [2022-02-20 19:43:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:10,621 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:10,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:10,622 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:10,651 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:10,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:10,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:10,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:10,652 INFO L87 Difference]: Start difference. First operand 1580 states and 2567 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:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:13,541 INFO L93 Difference]: Finished difference Result 1948 states and 3143 transitions. [2022-02-20 19:43:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:43:13,541 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:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:13,542 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:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2116 transitions. [2022-02-20 19:43:13,550 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:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2116 transitions. [2022-02-20 19:43:13,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2116 transitions. [2022-02-20 19:43:15,258 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:15,363 INFO L225 Difference]: With dead ends: 1948 [2022-02-20 19:43:15,364 INFO L226 Difference]: Without dead ends: 1902 [2022-02-20 19:43:15,364 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:15,365 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 6574 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:15,367 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.1s Time] [2022-02-20 19:43:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2022-02-20 19:43:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1624. [2022-02-20 19:43:15,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:15,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1902 states. Second operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call 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,458 INFO L74 IsIncluded]: Start isIncluded. First operand 1902 states. Second operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call 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,463 INFO L87 Difference]: Start difference. First operand 1902 states. Second operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call 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,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:15,571 INFO L93 Difference]: Finished difference Result 1902 states and 3063 transitions. [2022-02-20 19:43:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3063 transitions. [2022-02-20 19:43:15,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:15,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:15,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 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 1902 states. [2022-02-20 19:43:15,584 INFO L87 Difference]: Start difference. First operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 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 1902 states. [2022-02-20 19:43:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:15,696 INFO L93 Difference]: Finished difference Result 1902 states and 3063 transitions. [2022-02-20 19:43:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3063 transitions. [2022-02-20 19:43:15,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:15,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:15,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:15,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call 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,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2636 transitions. [2022-02-20 19:43:15,904 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2636 transitions. Word has length 52 [2022-02-20 19:43:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:15,905 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 2636 transitions. [2022-02-20 19:43:15,905 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:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2636 transitions. [2022-02-20 19:43:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:15,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:15,908 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,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:43:15,909 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:15,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:15,910 INFO L85 PathProgramCache]: Analyzing trace with hash -524152242, now seen corresponding path program 1 times [2022-02-20 19:43:15,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:15,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306864066] [2022-02-20 19:43:15,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:15,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:16,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {23213#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; {23213#true} is VALID [2022-02-20 19:43:16,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {23213#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; {23213#true} is VALID [2022-02-20 19:43:16,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {23213#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; {23213#true} is VALID [2022-02-20 19:43:16,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {23213#true} assume 0 == ~r1~0 % 256; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {23215#(<= ~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; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:16,039 INFO L290 TraceCheckUtils]: 48: Hoare triple {23215#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {23214#false} is VALID [2022-02-20 19:43:16,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {23214#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {23214#false} is VALID [2022-02-20 19:43:16,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {23214#false} check_#res#1 := check_~tmp~1#1; {23214#false} is VALID [2022-02-20 19:43:16,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {23214#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; {23214#false} is VALID [2022-02-20 19:43:16,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {23214#false} assume 0 == assert_~arg#1 % 256; {23214#false} is VALID [2022-02-20 19:43:16,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {23214#false} assume !false; {23214#false} is VALID [2022-02-20 19:43:16,040 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,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:16,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306864066] [2022-02-20 19:43:16,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306864066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:16,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:16,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:16,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236966705] [2022-02-20 19:43:16,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:16,042 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,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:16,044 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,096 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,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:16,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:16,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:16,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:16,097 INFO L87 Difference]: Start difference. First operand 1624 states and 2636 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,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:17,801 INFO L93 Difference]: Finished difference Result 1793 states and 2899 transitions. [2022-02-20 19:43:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:17,801 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,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:17,802 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,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2022-02-20 19:43:17,809 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,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2022-02-20 19:43:17,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1675 transitions. [2022-02-20 19:43:18,980 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:19,071 INFO L225 Difference]: With dead ends: 1793 [2022-02-20 19:43:19,071 INFO L226 Difference]: Without dead ends: 1703 [2022-02-20 19:43:19,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:19,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:19,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:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-02-20 19:43:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1699. [2022-02-20 19:43:19,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:19,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1703 states. Second operand has 1699 states, 1697 states have (on average 1.6205067766647023) internal successors, (2750), 1698 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call 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,215 INFO L74 IsIncluded]: Start isIncluded. First operand 1703 states. Second operand has 1699 states, 1697 states have (on average 1.6205067766647023) internal successors, (2750), 1698 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call 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,216 INFO L87 Difference]: Start difference. First operand 1703 states. Second operand has 1699 states, 1697 states have (on average 1.6205067766647023) internal successors, (2750), 1698 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call 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,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:19,293 INFO L93 Difference]: Finished difference Result 1703 states and 2753 transitions. [2022-02-20 19:43:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2753 transitions. [2022-02-20 19:43:19,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:19,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:19,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 1699 states, 1697 states have (on average 1.6205067766647023) internal successors, (2750), 1698 states have internal predecessors, (2750), 0 states have call successors, (0), 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 1703 states. [2022-02-20 19:43:19,299 INFO L87 Difference]: Start difference. First operand has 1699 states, 1697 states have (on average 1.6205067766647023) internal successors, (2750), 1698 states have internal predecessors, (2750), 0 states have call successors, (0), 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 1703 states. [2022-02-20 19:43:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:19,384 INFO L93 Difference]: Finished difference Result 1703 states and 2753 transitions. [2022-02-20 19:43:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2753 transitions. [2022-02-20 19:43:19,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:19,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:19,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:19,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1697 states have (on average 1.6205067766647023) internal successors, (2750), 1698 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call 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,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2750 transitions. [2022-02-20 19:43:19,472 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2750 transitions. Word has length 54 [2022-02-20 19:43:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:19,472 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2750 transitions. [2022-02-20 19:43:19,473 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,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2750 transitions. [2022-02-20 19:43:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:19,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:19,473 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,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:43:19,474 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash -457658730, now seen corresponding path program 1 times [2022-02-20 19:43:19,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:19,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148515628] [2022-02-20 19:43:19,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:19,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {30206#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; {30206#true} is VALID [2022-02-20 19:43:19,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {30206#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; {30206#true} is VALID [2022-02-20 19:43:19,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {30206#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; {30206#true} is VALID [2022-02-20 19:43:19,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {30206#true} assume 0 == ~r1~0 % 256; {30206#true} is VALID [2022-02-20 19:43:19,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {30206#true} assume ~id1~0 >= 0; {30206#true} is VALID [2022-02-20 19:43:19,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {30206#true} assume 0 == ~st1~0; {30208#(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:19,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {30208#(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; {30208#(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:19,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {30208#(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; {30208#(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:19,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {30208#(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; {30208#(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:19,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {30208#(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; {30209#(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:19,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {30209#(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; {30209#(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:19,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {30209#(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; {30209#(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:19,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {30209#(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; {30209#(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:19,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {30209#(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; {30210#(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:19,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {30210#(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; {30210#(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:19,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {30210#(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; {30210#(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:19,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {30210#(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; {30210#(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:19,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {30210#(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; {30211#(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:19,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {30211#(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; {30211#(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:19,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {30211#(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; {30211#(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:19,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {30211#(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; {30211#(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:19,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {30211#(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; {30211#(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:19,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {30211#(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; {30211#(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:19,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {30211#(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; {30211#(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:19,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {30211#(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; {30211#(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:19,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {30211#(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; {30211#(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:19,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {30211#(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; {30211#(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:19,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {30211#(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; {30211#(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:19,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {30211#(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); {30211#(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:19,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {30211#(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; {30211#(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:19,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {30211#(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; {30211#(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:19,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {30211#(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); {30211#(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:19,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {30211#(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; {30211#(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:19,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {30211#(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; {30211#(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:19,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {30211#(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; {30211#(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:19,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {30211#(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); {30211#(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:19,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {30211#(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; {30211#(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:19,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {30211#(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; {30211#(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:19,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {30211#(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; {30211#(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:19,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {30211#(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); {30211#(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:19,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {30211#(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; {30211#(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:19,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {30211#(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; {30211#(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:19,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {30211#(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; {30211#(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:19,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {30211#(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); {30211#(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:19,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {30211#(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; {30211#(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:19,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {30211#(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; {30211#(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:19,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {30211#(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; {30211#(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:19,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {30211#(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; {30211#(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:19,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {30211#(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); {30211#(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:19,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {30211#(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; {30207#false} is VALID [2022-02-20 19:43:19,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {30207#false} check_#res#1 := check_~tmp~1#1; {30207#false} is VALID [2022-02-20 19:43:19,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {30207#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; {30207#false} is VALID [2022-02-20 19:43:19,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {30207#false} assume 0 == assert_~arg#1 % 256; {30207#false} is VALID [2022-02-20 19:43:19,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {30207#false} assume !false; {30207#false} is VALID [2022-02-20 19:43:19,665 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,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:19,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148515628] [2022-02-20 19:43:19,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148515628] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:19,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:19,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:43:19,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289751075] [2022-02-20 19:43:19,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:19,667 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:19,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:19,667 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:19,712 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,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:19,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:19,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:19,715 INFO L87 Difference]: Start difference. First operand 1699 states and 2750 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:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:21,844 INFO L93 Difference]: Finished difference Result 1866 states and 3006 transitions. [2022-02-20 19:43:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:43:21,845 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:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:21,845 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:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2022-02-20 19:43:21,850 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:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2022-02-20 19:43:21,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1682 transitions. [2022-02-20 19:43:23,155 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:23,244 INFO L225 Difference]: With dead ends: 1866 [2022-02-20 19:43:23,244 INFO L226 Difference]: Without dead ends: 1701 [2022-02-20 19:43:23,245 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:23,245 INFO L933 BasicCegarLoop]: 1540 mSDtfsCounter, 1593 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:23,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1593 Valid, 1814 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:43:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2022-02-20 19:43:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1699. [2022-02-20 19:43:23,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:23,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1701 states. Second operand has 1699 states, 1697 states have (on average 1.6193282262816735) internal successors, (2748), 1698 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call 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:23,386 INFO L74 IsIncluded]: Start isIncluded. First operand 1701 states. Second operand has 1699 states, 1697 states have (on average 1.6193282262816735) internal successors, (2748), 1698 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call 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:23,388 INFO L87 Difference]: Start difference. First operand 1701 states. Second operand has 1699 states, 1697 states have (on average 1.6193282262816735) internal successors, (2748), 1698 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call 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:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:23,470 INFO L93 Difference]: Finished difference Result 1701 states and 2749 transitions. [2022-02-20 19:43:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2749 transitions. [2022-02-20 19:43:23,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:23,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:23,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 1699 states, 1697 states have (on average 1.6193282262816735) internal successors, (2748), 1698 states have internal predecessors, (2748), 0 states have call successors, (0), 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 1701 states. [2022-02-20 19:43:23,475 INFO L87 Difference]: Start difference. First operand has 1699 states, 1697 states have (on average 1.6193282262816735) internal successors, (2748), 1698 states have internal predecessors, (2748), 0 states have call successors, (0), 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 1701 states. [2022-02-20 19:43:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:23,565 INFO L93 Difference]: Finished difference Result 1701 states and 2749 transitions. [2022-02-20 19:43:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2749 transitions. [2022-02-20 19:43:23,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:23,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:23,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:23,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1697 states have (on average 1.6193282262816735) internal successors, (2748), 1698 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call 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:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2748 transitions. [2022-02-20 19:43:23,655 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2748 transitions. Word has length 54 [2022-02-20 19:43:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:23,656 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2748 transitions. [2022-02-20 19:43:23,656 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:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2748 transitions. [2022-02-20 19:43:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:23,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:23,657 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:23,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:43:23,657 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1331255346, now seen corresponding path program 1 times [2022-02-20 19:43:23,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:23,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278059702] [2022-02-20 19:43:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:23,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {37288#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; {37288#true} is VALID [2022-02-20 19:43:23,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {37288#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; {37288#true} is VALID [2022-02-20 19:43:23,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {37288#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; {37288#true} is VALID [2022-02-20 19:43:23,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {37288#true} assume 0 == ~r1~0 % 256; {37288#true} is VALID [2022-02-20 19:43:23,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {37288#true} assume ~id1~0 >= 0; {37288#true} is VALID [2022-02-20 19:43:23,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {37288#true} assume 0 == ~st1~0; {37288#true} is VALID [2022-02-20 19:43:23,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {37288#true} assume ~send1~0 == ~id1~0; {37288#true} is VALID [2022-02-20 19:43:23,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {37288#true} assume 0 == ~mode1~0 % 256; {37288#true} is VALID [2022-02-20 19:43:23,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {37288#true} assume ~id2~0 >= 0; {37288#true} is VALID [2022-02-20 19:43:23,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {37288#true} assume 0 == ~st2~0; {37288#true} is VALID [2022-02-20 19:43:23,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {37288#true} assume ~send2~0 == ~id2~0; {37288#true} is VALID [2022-02-20 19:43:23,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {37288#true} assume 0 == ~mode2~0 % 256; {37288#true} is VALID [2022-02-20 19:43:23,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {37288#true} assume ~id3~0 >= 0; {37288#true} is VALID [2022-02-20 19:43:23,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {37288#true} assume 0 == ~st3~0; {37288#true} is VALID [2022-02-20 19:43:23,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {37288#true} assume ~send3~0 == ~id3~0; {37288#true} is VALID [2022-02-20 19:43:23,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {37288#true} assume 0 == ~mode3~0 % 256; {37288#true} is VALID [2022-02-20 19:43:23,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {37288#true} assume ~id4~0 >= 0; {37288#true} is VALID [2022-02-20 19:43:23,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {37288#true} assume 0 == ~st4~0; {37288#true} is VALID [2022-02-20 19:43:23,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {37288#true} assume ~send4~0 == ~id4~0; {37288#true} is VALID [2022-02-20 19:43:23,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {37288#true} assume 0 == ~mode4~0 % 256; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {37290#(= (+ (* (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; {37290#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:23,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {37290#(= (+ (* (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; {37289#false} is VALID [2022-02-20 19:43:23,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {37289#false} assume node4_~m4~0#1 != ~nomsg~0; {37289#false} is VALID [2022-02-20 19:43:23,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {37289#false} assume !(node4_~m4~0#1 > ~id4~0); {37289#false} is VALID [2022-02-20 19:43:23,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {37289#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {37289#false} is VALID [2022-02-20 19:43:23,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {37289#false} ~mode4~0 := 0; {37289#false} is VALID [2022-02-20 19:43:23,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {37289#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; {37289#false} is VALID [2022-02-20 19:43:23,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {37289#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {37289#false} is VALID [2022-02-20 19:43:23,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {37289#false} check_#res#1 := check_~tmp~1#1; {37289#false} is VALID [2022-02-20 19:43:23,715 INFO L290 TraceCheckUtils]: 51: Hoare triple {37289#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; {37289#false} is VALID [2022-02-20 19:43:23,715 INFO L290 TraceCheckUtils]: 52: Hoare triple {37289#false} assume 0 == assert_~arg#1 % 256; {37289#false} is VALID [2022-02-20 19:43:23,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {37289#false} assume !false; {37289#false} is VALID [2022-02-20 19:43:23,716 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:23,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:23,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278059702] [2022-02-20 19:43:23,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278059702] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:23,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:23,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:23,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140103123] [2022-02-20 19:43:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:23,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:23,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:23,717 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:23,757 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:23,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:23,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:23,758 INFO L87 Difference]: Start difference. First operand 1699 states and 2748 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:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:25,636 INFO L93 Difference]: Finished difference Result 2005 states and 3214 transitions. [2022-02-20 19:43:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:25,637 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:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:25,637 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:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:25,642 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:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:25,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:26,821 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,923 INFO L225 Difference]: With dead ends: 2005 [2022-02-20 19:43:26,923 INFO L226 Difference]: Without dead ends: 1840 [2022-02-20 19:43:26,924 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,924 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:26,925 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:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2022-02-20 19:43:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1838. [2022-02-20 19:43:27,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:27,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1840 states. Second operand has 1838 states, 1836 states have (on average 1.6100217864923747) internal successors, (2956), 1837 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call 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,089 INFO L74 IsIncluded]: Start isIncluded. First operand 1840 states. Second operand has 1838 states, 1836 states have (on average 1.6100217864923747) internal successors, (2956), 1837 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call 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,090 INFO L87 Difference]: Start difference. First operand 1840 states. Second operand has 1838 states, 1836 states have (on average 1.6100217864923747) internal successors, (2956), 1837 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call 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,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:27,203 INFO L93 Difference]: Finished difference Result 1840 states and 2957 transitions. [2022-02-20 19:43:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2957 transitions. [2022-02-20 19:43:27,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:27,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:27,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 1838 states, 1836 states have (on average 1.6100217864923747) internal successors, (2956), 1837 states have internal predecessors, (2956), 0 states have call successors, (0), 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 1840 states. [2022-02-20 19:43:27,209 INFO L87 Difference]: Start difference. First operand has 1838 states, 1836 states have (on average 1.6100217864923747) internal successors, (2956), 1837 states have internal predecessors, (2956), 0 states have call successors, (0), 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 1840 states. [2022-02-20 19:43:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:27,307 INFO L93 Difference]: Finished difference Result 1840 states and 2957 transitions. [2022-02-20 19:43:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2957 transitions. [2022-02-20 19:43:27,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:27,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:27,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:27,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1836 states have (on average 1.6100217864923747) internal successors, (2956), 1837 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call 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,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2956 transitions. [2022-02-20 19:43:27,443 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2956 transitions. Word has length 54 [2022-02-20 19:43:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:27,443 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2956 transitions. [2022-02-20 19:43:27,443 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:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2956 transitions. [2022-02-20 19:43:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:27,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:27,445 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:27,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:43:27,445 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1716204334, now seen corresponding path program 1 times [2022-02-20 19:43:27,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:27,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107106216] [2022-02-20 19:43:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:27,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {44973#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; {44973#true} is VALID [2022-02-20 19:43:27,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {44973#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; {44973#true} is VALID [2022-02-20 19:43:27,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {44973#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; {44973#true} is VALID [2022-02-20 19:43:27,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {44973#true} assume 0 == ~r1~0 % 256; {44973#true} is VALID [2022-02-20 19:43:27,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {44973#true} assume ~id1~0 >= 0; {44973#true} is VALID [2022-02-20 19:43:27,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {44973#true} assume 0 == ~st1~0; {44973#true} is VALID [2022-02-20 19:43:27,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {44973#true} assume ~send1~0 == ~id1~0; {44973#true} is VALID [2022-02-20 19:43:27,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {44973#true} assume 0 == ~mode1~0 % 256; {44973#true} is VALID [2022-02-20 19:43:27,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {44973#true} assume ~id2~0 >= 0; {44973#true} is VALID [2022-02-20 19:43:27,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {44973#true} assume 0 == ~st2~0; {44973#true} is VALID [2022-02-20 19:43:27,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {44973#true} assume ~send2~0 == ~id2~0; {44973#true} is VALID [2022-02-20 19:43:27,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {44973#true} assume 0 == ~mode2~0 % 256; {44973#true} is VALID [2022-02-20 19:43:27,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {44973#true} assume ~id3~0 >= 0; {44973#true} is VALID [2022-02-20 19:43:27,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {44973#true} assume 0 == ~st3~0; {44973#true} is VALID [2022-02-20 19:43:27,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {44973#true} assume ~send3~0 == ~id3~0; {44973#true} is VALID [2022-02-20 19:43:27,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {44973#true} assume 0 == ~mode3~0 % 256; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {44975#(= (+ (* (- 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; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {44975#(= (+ (* (- 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; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {44975#(= (+ (* (- 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; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {44975#(= (+ (* (- 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; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {44975#(= (+ (* (- 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; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {44975#(= (+ (* (- 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; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {44975#(= (+ (* (- 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; {44975#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:27,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {44975#(= (+ (* (- 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; {44974#false} is VALID [2022-02-20 19:43:27,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {44974#false} assume node3_~m3~0#1 != ~nomsg~0; {44974#false} is VALID [2022-02-20 19:43:27,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {44974#false} assume !(node3_~m3~0#1 > ~id3~0); {44974#false} is VALID [2022-02-20 19:43:27,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {44974#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {44974#false} is VALID [2022-02-20 19:43:27,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {44974#false} ~mode3~0 := 0; {44974#false} is VALID [2022-02-20 19:43:27,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {44974#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; {44974#false} is VALID [2022-02-20 19:43:27,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {44974#false} assume !(0 != ~mode4~0 % 256); {44974#false} is VALID [2022-02-20 19:43:27,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {44974#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {44974#false} is VALID [2022-02-20 19:43:27,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {44974#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; {44974#false} is VALID [2022-02-20 19:43:27,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {44974#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; {44974#false} is VALID [2022-02-20 19:43:27,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {44974#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {44974#false} is VALID [2022-02-20 19:43:27,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {44974#false} check_#res#1 := check_~tmp~1#1; {44974#false} is VALID [2022-02-20 19:43:27,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {44974#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; {44974#false} is VALID [2022-02-20 19:43:27,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {44974#false} assume 0 == assert_~arg#1 % 256; {44974#false} is VALID [2022-02-20 19:43:27,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {44974#false} assume !false; {44974#false} is VALID [2022-02-20 19:43:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:27,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:27,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107106216] [2022-02-20 19:43:27,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107106216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:27,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:27,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:27,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738992780] [2022-02-20 19:43:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:27,521 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:27,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:27,527 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:27,548 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:27,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:27,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:27,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:27,549 INFO L87 Difference]: Start difference. First operand 1838 states and 2956 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:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:29,377 INFO L93 Difference]: Finished difference Result 2398 states and 3798 transitions. [2022-02-20 19:43:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:29,378 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:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:29,379 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:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:29,384 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:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:29,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:30,835 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:30,962 INFO L225 Difference]: With dead ends: 2398 [2022-02-20 19:43:30,963 INFO L226 Difference]: Without dead ends: 2094 [2022-02-20 19:43:30,972 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:30,972 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:30,973 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:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-02-20 19:43:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2092. [2022-02-20 19:43:31,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:31,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2094 states. Second operand has 2092 states, 2090 states have (on average 1.5923444976076555) internal successors, (3328), 2091 states have internal predecessors, (3328), 0 states have call successors, (0), 0 states have call 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:31,329 INFO L74 IsIncluded]: Start isIncluded. First operand 2094 states. Second operand has 2092 states, 2090 states have (on average 1.5923444976076555) internal successors, (3328), 2091 states have internal predecessors, (3328), 0 states have call successors, (0), 0 states have call 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:31,331 INFO L87 Difference]: Start difference. First operand 2094 states. Second operand has 2092 states, 2090 states have (on average 1.5923444976076555) internal successors, (3328), 2091 states have internal predecessors, (3328), 0 states have call successors, (0), 0 states have call 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:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:31,458 INFO L93 Difference]: Finished difference Result 2094 states and 3329 transitions. [2022-02-20 19:43:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3329 transitions. [2022-02-20 19:43:31,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:31,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:31,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 2092 states, 2090 states have (on average 1.5923444976076555) internal successors, (3328), 2091 states have internal predecessors, (3328), 0 states have call successors, (0), 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 2094 states. [2022-02-20 19:43:31,464 INFO L87 Difference]: Start difference. First operand has 2092 states, 2090 states have (on average 1.5923444976076555) internal successors, (3328), 2091 states have internal predecessors, (3328), 0 states have call successors, (0), 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 2094 states. [2022-02-20 19:43:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:31,592 INFO L93 Difference]: Finished difference Result 2094 states and 3329 transitions. [2022-02-20 19:43:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3329 transitions. [2022-02-20 19:43:31,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:31,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:31,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:31,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2090 states have (on average 1.5923444976076555) internal successors, (3328), 2091 states have internal predecessors, (3328), 0 states have call successors, (0), 0 states have call 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:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3328 transitions. [2022-02-20 19:43:31,771 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3328 transitions. Word has length 54 [2022-02-20 19:43:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:31,771 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 3328 transitions. [2022-02-20 19:43:31,772 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:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3328 transitions. [2022-02-20 19:43:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:31,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:31,773 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:31,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:43:31,773 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1442516622, now seen corresponding path program 1 times [2022-02-20 19:43:31,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:31,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068875757] [2022-02-20 19:43:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:31,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {53948#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; {53948#true} is VALID [2022-02-20 19:43:31,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {53948#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; {53948#true} is VALID [2022-02-20 19:43:31,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {53948#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; {53948#true} is VALID [2022-02-20 19:43:31,850 INFO L290 TraceCheckUtils]: 3: Hoare triple {53948#true} assume 0 == ~r1~0 % 256; {53948#true} is VALID [2022-02-20 19:43:31,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {53948#true} assume ~id1~0 >= 0; {53948#true} is VALID [2022-02-20 19:43:31,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {53948#true} assume 0 == ~st1~0; {53948#true} is VALID [2022-02-20 19:43:31,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {53948#true} assume ~send1~0 == ~id1~0; {53948#true} is VALID [2022-02-20 19:43:31,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {53948#true} assume 0 == ~mode1~0 % 256; {53948#true} is VALID [2022-02-20 19:43:31,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {53948#true} assume ~id2~0 >= 0; {53948#true} is VALID [2022-02-20 19:43:31,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {53948#true} assume 0 == ~st2~0; {53948#true} is VALID [2022-02-20 19:43:31,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {53948#true} assume ~send2~0 == ~id2~0; {53948#true} is VALID [2022-02-20 19:43:31,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {53948#true} assume 0 == ~mode2~0 % 256; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {53950#(= (+ (* (- 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; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {53950#(= (+ (* (- 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; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {53950#(= (+ (* (- 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; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {53950#(= (+ (* (- 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; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {53950#(= (+ (* (- 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; {53950#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:31,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {53950#(= (+ (* (- 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; {53949#false} is VALID [2022-02-20 19:43:31,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {53949#false} assume node2_~m2~0#1 != ~nomsg~0; {53949#false} is VALID [2022-02-20 19:43:31,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {53949#false} assume !(node2_~m2~0#1 > ~id2~0); {53949#false} is VALID [2022-02-20 19:43:31,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {53949#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {53949#false} is VALID [2022-02-20 19:43:31,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {53949#false} ~mode2~0 := 0; {53949#false} is VALID [2022-02-20 19:43:31,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {53949#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; {53949#false} is VALID [2022-02-20 19:43:31,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {53949#false} assume !(0 != ~mode3~0 % 256); {53949#false} is VALID [2022-02-20 19:43:31,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {53949#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {53949#false} is VALID [2022-02-20 19:43:31,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {53949#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; {53949#false} is VALID [2022-02-20 19:43:31,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {53949#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; {53949#false} is VALID [2022-02-20 19:43:31,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {53949#false} assume !(0 != ~mode4~0 % 256); {53949#false} is VALID [2022-02-20 19:43:31,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {53949#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {53949#false} is VALID [2022-02-20 19:43:31,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {53949#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; {53949#false} is VALID [2022-02-20 19:43:31,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {53949#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; {53949#false} is VALID [2022-02-20 19:43:31,874 INFO L290 TraceCheckUtils]: 49: Hoare triple {53949#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {53949#false} is VALID [2022-02-20 19:43:31,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {53949#false} check_#res#1 := check_~tmp~1#1; {53949#false} is VALID [2022-02-20 19:43:31,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {53949#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; {53949#false} is VALID [2022-02-20 19:43:31,875 INFO L290 TraceCheckUtils]: 52: Hoare triple {53949#false} assume 0 == assert_~arg#1 % 256; {53949#false} is VALID [2022-02-20 19:43:31,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {53949#false} assume !false; {53949#false} is VALID [2022-02-20 19:43:31,875 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:31,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:31,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068875757] [2022-02-20 19:43:31,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068875757] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:31,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:31,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:31,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35992153] [2022-02-20 19:43:31,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:31,876 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:31,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:31,877 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:31,972 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:31,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:31,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:31,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:31,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:31,974 INFO L87 Difference]: Start difference. First operand 2092 states and 3328 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:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:34,068 INFO L93 Difference]: Finished difference Result 3112 states and 4834 transitions. [2022-02-20 19:43:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:34,068 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:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:34,069 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:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:34,074 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:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:34,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:35,179 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:35,409 INFO L225 Difference]: With dead ends: 3112 [2022-02-20 19:43:35,410 INFO L226 Difference]: Without dead ends: 2554 [2022-02-20 19:43:35,411 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:35,418 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:35,418 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:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-02-20 19:43:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2552. [2022-02-20 19:43:35,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:35,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2554 states. Second operand has 2552 states, 2550 states have (on average 1.5623529411764705) internal successors, (3984), 2551 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call 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,926 INFO L74 IsIncluded]: Start isIncluded. First operand 2554 states. Second operand has 2552 states, 2550 states have (on average 1.5623529411764705) internal successors, (3984), 2551 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call 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,928 INFO L87 Difference]: Start difference. First operand 2554 states. Second operand has 2552 states, 2550 states have (on average 1.5623529411764705) internal successors, (3984), 2551 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call 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,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:36,315 INFO L93 Difference]: Finished difference Result 2554 states and 3985 transitions. [2022-02-20 19:43:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3985 transitions. [2022-02-20 19:43:36,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:36,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:36,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 2552 states, 2550 states have (on average 1.5623529411764705) internal successors, (3984), 2551 states have internal predecessors, (3984), 0 states have call successors, (0), 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 2554 states. [2022-02-20 19:43:36,322 INFO L87 Difference]: Start difference. First operand has 2552 states, 2550 states have (on average 1.5623529411764705) internal successors, (3984), 2551 states have internal predecessors, (3984), 0 states have call successors, (0), 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 2554 states. [2022-02-20 19:43:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:36,497 INFO L93 Difference]: Finished difference Result 2554 states and 3985 transitions. [2022-02-20 19:43:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3985 transitions. [2022-02-20 19:43:36,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:36,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:36,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:36,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5623529411764705) internal successors, (3984), 2551 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call 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,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3984 transitions. [2022-02-20 19:43:36,688 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3984 transitions. Word has length 54 [2022-02-20 19:43:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:36,688 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 3984 transitions. [2022-02-20 19:43:36,688 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:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3984 transitions. [2022-02-20 19:43:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:43:36,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:36,689 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:36,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:43:36,689 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1717241860, now seen corresponding path program 1 times [2022-02-20 19:43:36,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:36,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33179726] [2022-02-20 19:43:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:36,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {65287#true} assume 0 == ~r1~0 % 256; {65287#true} is VALID [2022-02-20 19:43:36,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {65287#true} assume ~id1~0 >= 0; {65287#true} is VALID [2022-02-20 19:43:36,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {65287#true} assume 0 == ~st1~0; {65287#true} is VALID [2022-02-20 19:43:36,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {65287#true} assume ~send1~0 == ~id1~0; {65287#true} is VALID [2022-02-20 19:43:36,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {65287#true} assume 0 == ~mode1~0 % 256; {65287#true} is VALID [2022-02-20 19:43:36,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {65287#true} assume ~id2~0 >= 0; {65287#true} is VALID [2022-02-20 19:43:36,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {65287#true} assume 0 == ~st2~0; {65287#true} is VALID [2022-02-20 19:43:36,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {65287#true} assume ~send2~0 == ~id2~0; {65287#true} is VALID [2022-02-20 19:43:36,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {65287#true} assume 0 == ~mode2~0 % 256; {65287#true} is VALID [2022-02-20 19:43:36,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {65287#true} assume ~id3~0 >= 0; {65287#true} is VALID [2022-02-20 19:43:36,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {65287#true} assume 0 == ~st3~0; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {65287#true} assume ~send3~0 == ~id3~0; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {65287#true} assume 0 == ~mode3~0 % 256; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {65287#true} assume ~id4~0 >= 0; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {65287#true} assume 0 == ~st4~0; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {65287#true} assume ~send4~0 == ~id4~0; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {65287#true} assume 0 == ~mode4~0 % 256; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {65287#true} assume ~id1~0 != ~id2~0; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {65287#true} assume ~id1~0 != ~id3~0; {65287#true} is VALID [2022-02-20 19:43:36,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {65287#true} assume ~id1~0 != ~id4~0; {65287#true} is VALID [2022-02-20 19:43:36,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {65287#true} assume ~id2~0 != ~id3~0; {65287#true} is VALID [2022-02-20 19:43:36,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {65287#true} assume ~id2~0 != ~id4~0; {65287#true} is VALID [2022-02-20 19:43:36,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {65287#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {65289#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:43:36,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {65289#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {65290#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:43:36,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {65290#(= |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; {65291#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:43:36,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {65291#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {65287#true} is VALID [2022-02-20 19:43:36,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {65287#true} assume !(0 != ~mode1~0 % 256); {65287#true} is VALID [2022-02-20 19:43:36,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {65287#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {65287#true} assume !(0 != ~mode2~0 % 256); {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {65287#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {65287#true} assume !(0 != ~mode3~0 % 256); {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {65287#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {65287#true} is VALID [2022-02-20 19:43:36,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {65287#true} assume !(0 != ~mode4~0 % 256); {65287#true} is VALID [2022-02-20 19:43:36,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {65287#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {65287#true} is VALID [2022-02-20 19:43:36,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {65287#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; {65287#true} is VALID [2022-02-20 19:43:36,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {65287#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {65287#true} is VALID [2022-02-20 19:43:36,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {65287#true} assume !(~r1~0 % 256 >= 4); {65287#true} is VALID [2022-02-20 19:43:36,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {65287#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {65287#true} is VALID [2022-02-20 19:43:36,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {65287#true} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {65292#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:43:36,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {65292#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {65293#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:43:36,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {65293#(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; {65294#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:43:36,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {65294#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {65288#false} is VALID [2022-02-20 19:43:36,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {65288#false} assume !false; {65288#false} is VALID [2022-02-20 19:43:36,768 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,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:36,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33179726] [2022-02-20 19:43:36,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33179726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:36,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:36,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:43:36,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949258249] [2022-02-20 19:43:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:36,769 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:36,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:36,770 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:36,796 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:36,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:43:36,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:43:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:43:36,796 INFO L87 Difference]: Start difference. First operand 2552 states and 3984 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:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:44,276 INFO L93 Difference]: Finished difference Result 3322 states and 5085 transitions. [2022-02-20 19:43:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:43:44,276 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:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:44,277 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:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1616 transitions. [2022-02-20 19:43:44,281 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:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1616 transitions. [2022-02-20 19:43:44,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1616 transitions. [2022-02-20 19:43:45,308 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:45,716 INFO L225 Difference]: With dead ends: 3322 [2022-02-20 19:43:45,716 INFO L226 Difference]: Without dead ends: 3320 [2022-02-20 19:43:45,717 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:45,717 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:45,717 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:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2022-02-20 19:43:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 2600. [2022-02-20 19:43:46,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:46,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3320 states. Second operand has 2600 states, 2598 states have (on average 1.5488837567359508) internal successors, (4024), 2599 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call 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:46,632 INFO L74 IsIncluded]: Start isIncluded. First operand 3320 states. Second operand has 2600 states, 2598 states have (on average 1.5488837567359508) internal successors, (4024), 2599 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call 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:46,635 INFO L87 Difference]: Start difference. First operand 3320 states. Second operand has 2600 states, 2598 states have (on average 1.5488837567359508) internal successors, (4024), 2599 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call 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:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:47,088 INFO L93 Difference]: Finished difference Result 3320 states and 5060 transitions. [2022-02-20 19:43:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 5060 transitions. [2022-02-20 19:43:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:47,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:47,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 2600 states, 2598 states have (on average 1.5488837567359508) internal successors, (4024), 2599 states have internal predecessors, (4024), 0 states have call successors, (0), 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 3320 states. [2022-02-20 19:43:47,096 INFO L87 Difference]: Start difference. First operand has 2600 states, 2598 states have (on average 1.5488837567359508) internal successors, (4024), 2599 states have internal predecessors, (4024), 0 states have call successors, (0), 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 3320 states. [2022-02-20 19:43:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:47,591 INFO L93 Difference]: Finished difference Result 3320 states and 5060 transitions. [2022-02-20 19:43:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 5060 transitions. [2022-02-20 19:43:47,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:47,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:47,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:47,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2598 states have (on average 1.5488837567359508) internal successors, (4024), 2599 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call 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:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 4024 transitions. [2022-02-20 19:43:47,933 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 4024 transitions. Word has length 55 [2022-02-20 19:43:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:47,934 INFO L470 AbstractCegarLoop]: Abstraction has 2600 states and 4024 transitions. [2022-02-20 19:43:47,934 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:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 4024 transitions. [2022-02-20 19:43:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 19:43:47,935 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:47,935 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:47,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:43:47,935 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash -754642547, now seen corresponding path program 1 times [2022-02-20 19:43:47,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:47,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28016935] [2022-02-20 19:43:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:47,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:47,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {78535#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; {78535#true} is VALID [2022-02-20 19:43:47,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {78535#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; {78535#true} is VALID [2022-02-20 19:43:47,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {78535#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; {78535#true} is VALID [2022-02-20 19:43:47,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {78535#true} assume 0 == ~r1~0 % 256; {78535#true} is VALID [2022-02-20 19:43:47,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {78535#true} assume ~id1~0 >= 0; {78535#true} is VALID [2022-02-20 19:43:47,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {78535#true} assume 0 == ~st1~0; {78535#true} is VALID [2022-02-20 19:43:47,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {78535#true} assume ~send1~0 == ~id1~0; {78535#true} is VALID [2022-02-20 19:43:47,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {78535#true} assume 0 == ~mode1~0 % 256; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {78537#(= (+ (* (- 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; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {78537#(= (+ (* (- 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; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {78537#(= (+ (* (- 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; {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:47,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {78537#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {78536#false} is VALID [2022-02-20 19:43:47,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {78536#false} assume !(255 == ~r1~0 % 256); {78536#false} is VALID [2022-02-20 19:43:47,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {78536#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {78536#false} is VALID [2022-02-20 19:43:47,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {78536#false} assume node1_~m1~0#1 != ~nomsg~0; {78536#false} is VALID [2022-02-20 19:43:47,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {78536#false} assume !(node1_~m1~0#1 > ~id1~0); {78536#false} is VALID [2022-02-20 19:43:47,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {78536#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {78536#false} is VALID [2022-02-20 19:43:47,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {78536#false} ~mode1~0 := 0; {78536#false} is VALID [2022-02-20 19:43:47,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {78536#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; {78536#false} is VALID [2022-02-20 19:43:47,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {78536#false} assume !(0 != ~mode2~0 % 256); {78536#false} is VALID [2022-02-20 19:43:47,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {78536#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {78536#false} is VALID [2022-02-20 19:43:47,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {78536#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; {78536#false} is VALID [2022-02-20 19:43:47,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {78536#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; {78536#false} is VALID [2022-02-20 19:43:47,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {78536#false} assume !(0 != ~mode3~0 % 256); {78536#false} is VALID [2022-02-20 19:43:47,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {78536#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {78536#false} is VALID [2022-02-20 19:43:47,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {78536#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; {78536#false} is VALID [2022-02-20 19:43:47,997 INFO L290 TraceCheckUtils]: 46: Hoare triple {78536#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; {78536#false} is VALID [2022-02-20 19:43:47,997 INFO L290 TraceCheckUtils]: 47: Hoare triple {78536#false} assume !(0 != ~mode4~0 % 256); {78536#false} is VALID [2022-02-20 19:43:47,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {78536#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {78536#false} is VALID [2022-02-20 19:43:47,998 INFO L290 TraceCheckUtils]: 49: Hoare triple {78536#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; {78536#false} is VALID [2022-02-20 19:43:47,998 INFO L290 TraceCheckUtils]: 50: Hoare triple {78536#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; {78536#false} is VALID [2022-02-20 19:43:47,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {78536#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {78536#false} is VALID [2022-02-20 19:43:47,998 INFO L290 TraceCheckUtils]: 52: Hoare triple {78536#false} check_#res#1 := check_~tmp~1#1; {78536#false} is VALID [2022-02-20 19:43:47,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {78536#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; {78536#false} is VALID [2022-02-20 19:43:47,998 INFO L290 TraceCheckUtils]: 54: Hoare triple {78536#false} assume 0 == assert_~arg#1 % 256; {78536#false} is VALID [2022-02-20 19:43:47,998 INFO L290 TraceCheckUtils]: 55: Hoare triple {78536#false} assume !false; {78536#false} is VALID [2022-02-20 19:43:47,998 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:47,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:47,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28016935] [2022-02-20 19:43:47,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28016935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:47,999 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:47,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:47,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640926529] [2022-02-20 19:43:47,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:48,000 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:48,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:48,000 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:48,043 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:48,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:48,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:48,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:48,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:48,044 INFO L87 Difference]: Start difference. First operand 2600 states and 4024 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:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:50,783 INFO L93 Difference]: Finished difference Result 3695 states and 5614 transitions. [2022-02-20 19:43:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:50,783 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:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:50,784 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:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1671 transitions. [2022-02-20 19:43:50,788 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:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1671 transitions. [2022-02-20 19:43:50,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1671 transitions.