./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr.6.1.ufo.UNBOUNDED.pals.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 e7078db7101404701d1361cc736476696e00d8cbe0085be82e13ec1c6956c8c2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:30:03,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:30:03,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:30:03,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:30:03,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:30:03,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:30:03,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:30:03,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:30:03,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:30:03,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:30:03,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:30:03,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:30:03,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:30:03,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:30:03,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:30:03,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:30:03,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:30:03,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:30:03,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:30:03,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:30:03,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:30:03,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:30:03,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:30:03,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:30:03,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:30:03,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:30:03,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:30:03,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:30:03,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:30:03,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:30:03,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:30:03,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:30:03,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:30:03,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:30:03,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:30:03,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:30:03,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:30:03,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:30:03,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:30:03,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:30:03,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:30:03,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:30:03,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:30:03,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:30:03,435 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:30:03,435 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:30:03,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:30:03,436 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:30:03,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:30:03,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:30:03,437 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:30:03,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:30:03,438 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:30:03,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:30:03,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:30:03,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:30:03,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:30:03,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:30:03,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:30:03,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:30:03,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:30:03,446 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:30:03,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:30:03,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:30:03,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:30:03,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:30:03,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:03,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:30:03,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:30:03,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:30:03,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:30:03,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:30:03,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:30:03,449 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:30:03,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:30:03,450 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 -> e7078db7101404701d1361cc736476696e00d8cbe0085be82e13ec1c6956c8c2 [2022-02-20 18:30:03,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:30:03,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:30:03,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:30:03,720 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:30:03,721 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:30:03,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:03,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9b60fa9/e2155cede9504612a1dd434b54ef0c4b/FLAG34e27a334 [2022-02-20 18:30:04,185 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:30:04,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:04,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9b60fa9/e2155cede9504612a1dd434b54ef0c4b/FLAG34e27a334 [2022-02-20 18:30:04,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9b60fa9/e2155cede9504612a1dd434b54ef0c4b [2022-02-20 18:30:04,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:30:04,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:30:04,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:04,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:30:04,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:30:04,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496ecd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04, skipping insertion in model container [2022-02-20 18:30:04,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:30:04,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:30:04,440 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/seq-mthreaded/pals_lcr.6.1.ufo.UNBOUNDED.pals.c[15140,15153] [2022-02-20 18:30:04,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:04,458 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:30:04,507 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/seq-mthreaded/pals_lcr.6.1.ufo.UNBOUNDED.pals.c[15140,15153] [2022-02-20 18:30:04,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:04,536 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:30:04,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04 WrapperNode [2022-02-20 18:30:04,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:04,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:04,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:30:04,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:30:04,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,602 INFO L137 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 391 [2022-02-20 18:30:04,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:04,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:30:04,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:30:04,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:30:04,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:30:04,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:30:04,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:30:04,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:30:04,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (1/1) ... [2022-02-20 18:30:04,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:04,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:30:04,668 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 18:30:04,684 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 18:30:04,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:30:04,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:30:04,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:30:04,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:30:04,869 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:30:04,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:30:05,488 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:30:05,494 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:30:05,494 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:30:05,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:05 BoogieIcfgContainer [2022-02-20 18:30:05,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:30:05,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:30:05,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:30:05,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:30:05,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:30:04" (1/3) ... [2022-02-20 18:30:05,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532a19a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:05, skipping insertion in model container [2022-02-20 18:30:05,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:04" (2/3) ... [2022-02-20 18:30:05,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532a19a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:05, skipping insertion in model container [2022-02-20 18:30:05,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:05" (3/3) ... [2022-02-20 18:30:05,503 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:05,507 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:30:05,507 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:30:05,545 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:30:05,550 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 18:30:05,551 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:30:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 110 states have (on average 1.7363636363636363) internal successors, (191), 111 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:30:05,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:05,575 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] [2022-02-20 18:30:05,576 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash -606038097, now seen corresponding path program 1 times [2022-02-20 18:30:05,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:05,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424094855] [2022-02-20 18:30:05,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:05,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:05,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {115#true} is VALID [2022-02-20 18:30:05,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {115#true} is VALID [2022-02-20 18:30:05,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {115#true} is VALID [2022-02-20 18:30:05,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {115#true} init_#res#1 := init_~tmp~0#1; {115#true} is VALID [2022-02-20 18:30:05,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {115#true} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {115#true} is VALID [2022-02-20 18:30:05,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {116#false} is VALID [2022-02-20 18:30:05,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {116#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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {116#false} is VALID [2022-02-20 18:30:05,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {116#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#false} assume !(0 != ~mode1~0 % 256); {116#false} is VALID [2022-02-20 18:30:05,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {116#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {116#false} is VALID [2022-02-20 18:30:05,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {116#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {116#false} is VALID [2022-02-20 18:30:05,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {116#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {116#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {116#false} assume !(node2_~m2~0#1 != ~nomsg~0); {116#false} is VALID [2022-02-20 18:30:05,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {116#false} ~mode2~0 := 0; {116#false} is VALID [2022-02-20 18:30:05,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {116#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {116#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {116#false} assume !(node3_~m3~0#1 != ~nomsg~0); {116#false} is VALID [2022-02-20 18:30:05,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {116#false} ~mode3~0 := 0; {116#false} is VALID [2022-02-20 18:30:05,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {116#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {116#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {116#false} assume !(node4_~m4~0#1 != ~nomsg~0); {116#false} is VALID [2022-02-20 18:30:05,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {116#false} ~mode4~0 := 0; {116#false} is VALID [2022-02-20 18:30:05,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {116#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {116#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {116#false} assume !(node5_~m5~0#1 != ~nomsg~0); {116#false} is VALID [2022-02-20 18:30:05,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {116#false} ~mode5~0 := 0; {116#false} is VALID [2022-02-20 18:30:05,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {116#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {116#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {116#false} is VALID [2022-02-20 18:30:05,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {116#false} assume !(node6_~m6~0#1 != ~nomsg~0); {116#false} is VALID [2022-02-20 18:30:05,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {116#false} ~mode6~0 := 0; {116#false} is VALID [2022-02-20 18:30:05,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {116#false} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {116#false} is VALID [2022-02-20 18:30:05,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {116#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {116#false} is VALID [2022-02-20 18:30:05,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {116#false} check_#res#1 := check_~tmp~1#1; {116#false} is VALID [2022-02-20 18:30:05,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {116#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {116#false} is VALID [2022-02-20 18:30:05,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {116#false} assume 0 == assert_~arg#1 % 256; {116#false} is VALID [2022-02-20 18:30:05,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {116#false} assume !false; {116#false} is VALID [2022-02-20 18:30:05,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 18:30:05,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:05,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424094855] [2022-02-20 18:30:05,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424094855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:05,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:05,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:30:05,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869107293] [2022-02-20 18:30:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:05,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:30:05,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:05,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:05,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:05,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:30:05,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:05,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:30:05,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:05,956 INFO L87 Difference]: Start difference. First operand has 112 states, 110 states have (on average 1.7363636363636363) internal successors, (191), 111 states have internal predecessors, (191), 0 states have call successors, (0), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:06,111 INFO L93 Difference]: Finished difference Result 175 states and 293 transitions. [2022-02-20 18:30:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:30:06,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:30:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2022-02-20 18:30:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2022-02-20 18:30:06,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 293 transitions. [2022-02-20 18:30:06,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:06,409 INFO L225 Difference]: With dead ends: 175 [2022-02-20 18:30:06,409 INFO L226 Difference]: Without dead ends: 108 [2022-02-20 18:30:06,412 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 18:30:06,419 INFO L933 BasicCegarLoop]: 184 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, 184 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 18:30:06,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-20 18:30:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-02-20 18:30:06,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:06,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,449 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,450 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:06,456 INFO L93 Difference]: Finished difference Result 108 states and 184 transitions. [2022-02-20 18:30:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 184 transitions. [2022-02-20 18:30:06,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:06,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:06,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 0 states have call successors, (0), 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 108 states. [2022-02-20 18:30:06,459 INFO L87 Difference]: Start difference. First operand has 108 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 0 states have call successors, (0), 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 108 states. [2022-02-20 18:30:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:06,465 INFO L93 Difference]: Finished difference Result 108 states and 184 transitions. [2022-02-20 18:30:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 184 transitions. [2022-02-20 18:30:06,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:06,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:06,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:06,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 184 transitions. [2022-02-20 18:30:06,472 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 184 transitions. Word has length 37 [2022-02-20 18:30:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:06,473 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 184 transitions. [2022-02-20 18:30:06,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 184 transitions. [2022-02-20 18:30:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:30:06,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:06,475 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] [2022-02-20 18:30:06,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:30:06,475 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash -331278483, now seen corresponding path program 1 times [2022-02-20 18:30:06,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:06,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044441738] [2022-02-20 18:30:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:06,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {648#true} is VALID [2022-02-20 18:30:06,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {648#true} is VALID [2022-02-20 18:30:06,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {650#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:30:06,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {650#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {651#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:30:06,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {651#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {652#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:30:06,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {649#false} is VALID [2022-02-20 18:30:06,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {649#false} is VALID [2022-02-20 18:30:06,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#false} assume !(0 != ~mode1~0 % 256); {649#false} is VALID [2022-02-20 18:30:06,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {649#false} is VALID [2022-02-20 18:30:06,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {649#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {649#false} is VALID [2022-02-20 18:30:06,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#false} assume !(node2_~m2~0#1 != ~nomsg~0); {649#false} is VALID [2022-02-20 18:30:06,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#false} ~mode2~0 := 0; {649#false} is VALID [2022-02-20 18:30:06,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {649#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {649#false} assume !(node3_~m3~0#1 != ~nomsg~0); {649#false} is VALID [2022-02-20 18:30:06,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {649#false} ~mode3~0 := 0; {649#false} is VALID [2022-02-20 18:30:06,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {649#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {649#false} assume !(node4_~m4~0#1 != ~nomsg~0); {649#false} is VALID [2022-02-20 18:30:06,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {649#false} ~mode4~0 := 0; {649#false} is VALID [2022-02-20 18:30:06,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {649#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {649#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {649#false} assume !(node5_~m5~0#1 != ~nomsg~0); {649#false} is VALID [2022-02-20 18:30:06,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {649#false} ~mode5~0 := 0; {649#false} is VALID [2022-02-20 18:30:06,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {649#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {649#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {649#false} is VALID [2022-02-20 18:30:06,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {649#false} assume !(node6_~m6~0#1 != ~nomsg~0); {649#false} is VALID [2022-02-20 18:30:06,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {649#false} ~mode6~0 := 0; {649#false} is VALID [2022-02-20 18:30:06,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {649#false} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {649#false} is VALID [2022-02-20 18:30:06,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {649#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {649#false} is VALID [2022-02-20 18:30:06,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {649#false} check_#res#1 := check_~tmp~1#1; {649#false} is VALID [2022-02-20 18:30:06,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {649#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {649#false} is VALID [2022-02-20 18:30:06,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {649#false} assume 0 == assert_~arg#1 % 256; {649#false} is VALID [2022-02-20 18:30:06,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {649#false} assume !false; {649#false} is VALID [2022-02-20 18:30:06,642 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 18:30:06,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:06,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044441738] [2022-02-20 18:30:06,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044441738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:06,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:06,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:30:06,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161768025] [2022-02-20 18:30:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:30:06,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:06,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:06,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:06,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:30:06,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:30:06,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:30:06,684 INFO L87 Difference]: Start difference. First operand 108 states and 184 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,057 INFO L93 Difference]: Finished difference Result 174 states and 286 transitions. [2022-02-20 18:30:07,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:30:07,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:30:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-20 18:30:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-20 18:30:07,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 286 transitions. [2022-02-20 18:30:07,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:07,262 INFO L225 Difference]: With dead ends: 174 [2022-02-20 18:30:07,262 INFO L226 Difference]: Without dead ends: 108 [2022-02-20 18:30:07,263 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 18:30:07,264 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 3 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:07,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 685 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-20 18:30:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-02-20 18:30:07,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:07,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,271 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,272 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,275 INFO L93 Difference]: Finished difference Result 108 states and 144 transitions. [2022-02-20 18:30:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2022-02-20 18:30:07,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:07,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:07,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 0 states have call successors, (0), 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 108 states. [2022-02-20 18:30:07,277 INFO L87 Difference]: Start difference. First operand has 108 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 0 states have call successors, (0), 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 108 states. [2022-02-20 18:30:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,281 INFO L93 Difference]: Finished difference Result 108 states and 144 transitions. [2022-02-20 18:30:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2022-02-20 18:30:07,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:07,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:07,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:07,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 144 transitions. [2022-02-20 18:30:07,286 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 144 transitions. Word has length 37 [2022-02-20 18:30:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:07,286 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 144 transitions. [2022-02-20 18:30:07,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2022-02-20 18:30:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:07,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:07,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:07,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:30:07,289 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash 85749534, now seen corresponding path program 1 times [2022-02-20 18:30:07,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:07,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044620332] [2022-02-20 18:30:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:07,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {1187#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {1187#true} is VALID [2022-02-20 18:30:07,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1187#true} is VALID [2022-02-20 18:30:07,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume 0 == ~r1~0 % 256; {1187#true} is VALID [2022-02-20 18:30:07,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {1187#true} assume ~id1~0 >= 0; {1187#true} is VALID [2022-02-20 18:30:07,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {1187#true} assume 0 == ~st1~0; {1187#true} is VALID [2022-02-20 18:30:07,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#true} assume ~send1~0 == ~id1~0; {1187#true} is VALID [2022-02-20 18:30:07,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#true} assume 0 == ~mode1~0 % 256; {1187#true} is VALID [2022-02-20 18:30:07,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#true} assume ~id2~0 >= 0; {1187#true} is VALID [2022-02-20 18:30:07,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#true} assume 0 == ~st2~0; {1187#true} is VALID [2022-02-20 18:30:07,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#true} assume ~send2~0 == ~id2~0; {1187#true} is VALID [2022-02-20 18:30:07,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {1187#true} assume 0 == ~mode2~0 % 256; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,408 INFO L290 TraceCheckUtils]: 42: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {1189#(= (+ (* (- 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:07,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {1189#(= (+ (* (- 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; {1188#false} is VALID [2022-02-20 18:30:07,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {1188#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1188#false} is VALID [2022-02-20 18:30:07,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {1188#false} ~mode2~0 := 0; {1188#false} is VALID [2022-02-20 18:30:07,414 INFO L290 TraceCheckUtils]: 54: Hoare triple {1188#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1188#false} is VALID [2022-02-20 18:30:07,414 INFO L290 TraceCheckUtils]: 55: Hoare triple {1188#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1188#false} is VALID [2022-02-20 18:30:07,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {1188#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1188#false} is VALID [2022-02-20 18:30:07,414 INFO L290 TraceCheckUtils]: 57: Hoare triple {1188#false} ~mode3~0 := 0; {1188#false} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {1188#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1188#false} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {1188#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1188#false} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {1188#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1188#false} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {1188#false} ~mode4~0 := 0; {1188#false} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 62: Hoare triple {1188#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1188#false} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {1188#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1188#false} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 64: Hoare triple {1188#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1188#false} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 65: Hoare triple {1188#false} ~mode5~0 := 0; {1188#false} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 66: Hoare triple {1188#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1188#false} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 67: Hoare triple {1188#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1188#false} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {1188#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1188#false} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {1188#false} ~mode6~0 := 0; {1188#false} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {1188#false} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1188#false} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 71: Hoare triple {1188#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1188#false} is VALID [2022-02-20 18:30:07,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {1188#false} check_#res#1 := check_~tmp~1#1; {1188#false} is VALID [2022-02-20 18:30:07,418 INFO L290 TraceCheckUtils]: 73: Hoare triple {1188#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1188#false} is VALID [2022-02-20 18:30:07,418 INFO L290 TraceCheckUtils]: 74: Hoare triple {1188#false} assume 0 == assert_~arg#1 % 256; {1188#false} is VALID [2022-02-20 18:30:07,418 INFO L290 TraceCheckUtils]: 75: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2022-02-20 18:30:07,419 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 18:30:07,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:07,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044620332] [2022-02-20 18:30:07,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044620332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:07,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:07,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:07,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175155130] [2022-02-20 18:30:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:07,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:07,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:07,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:07,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:07,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:07,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:07,487 INFO L87 Difference]: Start difference. First operand 108 states and 144 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,683 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-02-20 18:30:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:07,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:07,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 330 transitions. [2022-02-20 18:30:07,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:07,953 INFO L225 Difference]: With dead ends: 226 [2022-02-20 18:30:07,953 INFO L226 Difference]: Without dead ends: 164 [2022-02-20 18:30:07,953 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 18:30:07,954 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 84 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 312 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 18:30:07,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-20 18:30:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2022-02-20 18:30:07,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:07,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 162 states, 161 states have (on average 1.4285714285714286) internal successors, (230), 161 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,977 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 162 states, 161 states have (on average 1.4285714285714286) internal successors, (230), 161 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,978 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 162 states, 161 states have (on average 1.4285714285714286) internal successors, (230), 161 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,983 INFO L93 Difference]: Finished difference Result 164 states and 231 transitions. [2022-02-20 18:30:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 231 transitions. [2022-02-20 18:30:07,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:07,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:07,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 161 states have (on average 1.4285714285714286) internal successors, (230), 161 states have internal predecessors, (230), 0 states have call successors, (0), 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 164 states. [2022-02-20 18:30:07,991 INFO L87 Difference]: Start difference. First operand has 162 states, 161 states have (on average 1.4285714285714286) internal successors, (230), 161 states have internal predecessors, (230), 0 states have call successors, (0), 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 164 states. [2022-02-20 18:30:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,996 INFO L93 Difference]: Finished difference Result 164 states and 231 transitions. [2022-02-20 18:30:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 231 transitions. [2022-02-20 18:30:07,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:07,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:08,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:08,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4285714285714286) internal successors, (230), 161 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 230 transitions. [2022-02-20 18:30:08,009 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 230 transitions. Word has length 76 [2022-02-20 18:30:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:08,010 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 230 transitions. [2022-02-20 18:30:08,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 230 transitions. [2022-02-20 18:30:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:08,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:08,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:08,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:30:08,012 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:08,013 INFO L85 PathProgramCache]: Analyzing trace with hash -659833196, now seen corresponding path program 1 times [2022-02-20 18:30:08,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:08,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604264002] [2022-02-20 18:30:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:08,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {1955#true} is VALID [2022-02-20 18:30:08,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {1955#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1955#true} is VALID [2022-02-20 18:30:08,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1955#true} assume 0 == ~r1~0 % 256; {1955#true} is VALID [2022-02-20 18:30:08,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {1955#true} assume ~id1~0 >= 0; {1955#true} is VALID [2022-02-20 18:30:08,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {1955#true} assume 0 == ~st1~0; {1955#true} is VALID [2022-02-20 18:30:08,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {1955#true} assume ~send1~0 == ~id1~0; {1955#true} is VALID [2022-02-20 18:30:08,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {1955#true} assume 0 == ~mode1~0 % 256; {1955#true} is VALID [2022-02-20 18:30:08,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {1955#true} assume ~id2~0 >= 0; {1955#true} is VALID [2022-02-20 18:30:08,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {1955#true} assume 0 == ~st2~0; {1955#true} is VALID [2022-02-20 18:30:08,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {1955#true} assume ~send2~0 == ~id2~0; {1955#true} is VALID [2022-02-20 18:30:08,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {1955#true} assume 0 == ~mode2~0 % 256; {1955#true} is VALID [2022-02-20 18:30:08,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {1955#true} assume ~id3~0 >= 0; {1955#true} is VALID [2022-02-20 18:30:08,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {1955#true} assume 0 == ~st3~0; {1955#true} is VALID [2022-02-20 18:30:08,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1955#true} assume ~send3~0 == ~id3~0; {1955#true} is VALID [2022-02-20 18:30:08,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {1955#true} assume 0 == ~mode3~0 % 256; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {1957#(= (+ (* (- 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1957#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:08,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {1957#(= (+ (* (- 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; {1956#false} is VALID [2022-02-20 18:30:08,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {1956#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1956#false} is VALID [2022-02-20 18:30:08,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {1956#false} ~mode3~0 := 0; {1956#false} is VALID [2022-02-20 18:30:08,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {1956#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1956#false} is VALID [2022-02-20 18:30:08,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {1956#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1956#false} is VALID [2022-02-20 18:30:08,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {1956#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1956#false} is VALID [2022-02-20 18:30:08,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {1956#false} ~mode4~0 := 0; {1956#false} is VALID [2022-02-20 18:30:08,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {1956#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1956#false} is VALID [2022-02-20 18:30:08,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {1956#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1956#false} is VALID [2022-02-20 18:30:08,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {1956#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1956#false} is VALID [2022-02-20 18:30:08,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {1956#false} ~mode5~0 := 0; {1956#false} is VALID [2022-02-20 18:30:08,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {1956#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1956#false} is VALID [2022-02-20 18:30:08,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {1956#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1956#false} is VALID [2022-02-20 18:30:08,153 INFO L290 TraceCheckUtils]: 68: Hoare triple {1956#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1956#false} is VALID [2022-02-20 18:30:08,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {1956#false} ~mode6~0 := 0; {1956#false} is VALID [2022-02-20 18:30:08,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {1956#false} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1956#false} is VALID [2022-02-20 18:30:08,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {1956#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1956#false} is VALID [2022-02-20 18:30:08,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {1956#false} check_#res#1 := check_~tmp~1#1; {1956#false} is VALID [2022-02-20 18:30:08,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {1956#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1956#false} is VALID [2022-02-20 18:30:08,155 INFO L290 TraceCheckUtils]: 74: Hoare triple {1956#false} assume 0 == assert_~arg#1 % 256; {1956#false} is VALID [2022-02-20 18:30:08,155 INFO L290 TraceCheckUtils]: 75: Hoare triple {1956#false} assume !false; {1956#false} is VALID [2022-02-20 18:30:08,155 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 18:30:08,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:08,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604264002] [2022-02-20 18:30:08,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604264002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:08,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:08,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:08,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043563121] [2022-02-20 18:30:08,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:08,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:08,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:08,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:08,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:08,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:08,222 INFO L87 Difference]: Start difference. First operand 162 states and 230 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:08,430 INFO L93 Difference]: Finished difference Result 382 states and 578 transitions. [2022-02-20 18:30:08,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:08,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:08,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 330 transitions. [2022-02-20 18:30:08,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:08,668 INFO L225 Difference]: With dead ends: 382 [2022-02-20 18:30:08,668 INFO L226 Difference]: Without dead ends: 266 [2022-02-20 18:30:08,669 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 18:30:08,670 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 80 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 311 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 18:30:08,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 311 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-02-20 18:30:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2022-02-20 18:30:08,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:08,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,685 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,686 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:08,694 INFO L93 Difference]: Finished difference Result 266 states and 392 transitions. [2022-02-20 18:30:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions. [2022-02-20 18:30:08,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:08,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:08,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 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 266 states. [2022-02-20 18:30:08,696 INFO L87 Difference]: Start difference. First operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 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 266 states. [2022-02-20 18:30:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:08,704 INFO L93 Difference]: Finished difference Result 266 states and 392 transitions. [2022-02-20 18:30:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions. [2022-02-20 18:30:08,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:08,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:08,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:08,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 391 transitions. [2022-02-20 18:30:08,713 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 391 transitions. Word has length 76 [2022-02-20 18:30:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:08,714 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 391 transitions. [2022-02-20 18:30:08,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 391 transitions. [2022-02-20 18:30:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:08,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:08,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:08,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:30:08,715 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1695103242, now seen corresponding path program 1 times [2022-02-20 18:30:08,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:08,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959497731] [2022-02-20 18:30:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:08,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {3230#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {3230#true} is VALID [2022-02-20 18:30:08,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {3230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3230#true} is VALID [2022-02-20 18:30:08,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {3230#true} assume 0 == ~r1~0 % 256; {3230#true} is VALID [2022-02-20 18:30:08,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {3230#true} assume ~id1~0 >= 0; {3230#true} is VALID [2022-02-20 18:30:08,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {3230#true} assume 0 == ~st1~0; {3230#true} is VALID [2022-02-20 18:30:08,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {3230#true} assume ~send1~0 == ~id1~0; {3230#true} is VALID [2022-02-20 18:30:08,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {3230#true} assume 0 == ~mode1~0 % 256; {3230#true} is VALID [2022-02-20 18:30:08,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {3230#true} assume ~id2~0 >= 0; {3230#true} is VALID [2022-02-20 18:30:08,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {3230#true} assume 0 == ~st2~0; {3230#true} is VALID [2022-02-20 18:30:08,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {3230#true} assume ~send2~0 == ~id2~0; {3230#true} is VALID [2022-02-20 18:30:08,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {3230#true} assume 0 == ~mode2~0 % 256; {3230#true} is VALID [2022-02-20 18:30:08,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {3230#true} assume ~id3~0 >= 0; {3230#true} is VALID [2022-02-20 18:30:08,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {3230#true} assume 0 == ~st3~0; {3230#true} is VALID [2022-02-20 18:30:08,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {3230#true} assume ~send3~0 == ~id3~0; {3230#true} is VALID [2022-02-20 18:30:08,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {3230#true} assume 0 == ~mode3~0 % 256; {3230#true} is VALID [2022-02-20 18:30:08,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {3230#true} assume ~id4~0 >= 0; {3230#true} is VALID [2022-02-20 18:30:08,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {3230#true} assume 0 == ~st4~0; {3230#true} is VALID [2022-02-20 18:30:08,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {3230#true} assume ~send4~0 == ~id4~0; {3230#true} is VALID [2022-02-20 18:30:08,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {3230#true} assume 0 == ~mode4~0 % 256; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {3232#(= (+ (* (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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3232#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:08,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {3232#(= (+ (* (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; {3231#false} is VALID [2022-02-20 18:30:08,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {3231#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3231#false} is VALID [2022-02-20 18:30:08,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {3231#false} ~mode4~0 := 0; {3231#false} is VALID [2022-02-20 18:30:08,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {3231#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3231#false} is VALID [2022-02-20 18:30:08,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {3231#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3231#false} is VALID [2022-02-20 18:30:08,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {3231#false} assume !(node5_~m5~0#1 != ~nomsg~0); {3231#false} is VALID [2022-02-20 18:30:08,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {3231#false} ~mode5~0 := 0; {3231#false} is VALID [2022-02-20 18:30:08,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {3231#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3231#false} is VALID [2022-02-20 18:30:08,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {3231#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3231#false} is VALID [2022-02-20 18:30:08,819 INFO L290 TraceCheckUtils]: 68: Hoare triple {3231#false} assume !(node6_~m6~0#1 != ~nomsg~0); {3231#false} is VALID [2022-02-20 18:30:08,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {3231#false} ~mode6~0 := 0; {3231#false} is VALID [2022-02-20 18:30:08,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {3231#false} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3231#false} is VALID [2022-02-20 18:30:08,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {3231#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {3231#false} is VALID [2022-02-20 18:30:08,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {3231#false} check_#res#1 := check_~tmp~1#1; {3231#false} is VALID [2022-02-20 18:30:08,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {3231#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3231#false} is VALID [2022-02-20 18:30:08,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {3231#false} assume 0 == assert_~arg#1 % 256; {3231#false} is VALID [2022-02-20 18:30:08,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {3231#false} assume !false; {3231#false} is VALID [2022-02-20 18:30:08,821 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 18:30:08,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:08,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959497731] [2022-02-20 18:30:08,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959497731] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:08,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:08,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:08,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038610248] [2022-02-20 18:30:08,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:08,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:08,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:08,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:08,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:08,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:08,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:08,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:08,878 INFO L87 Difference]: Start difference. First operand 264 states and 391 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:09,102 INFO L93 Difference]: Finished difference Result 676 states and 1041 transitions. [2022-02-20 18:30:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:09,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:09,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 330 transitions. [2022-02-20 18:30:09,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:09,362 INFO L225 Difference]: With dead ends: 676 [2022-02-20 18:30:09,362 INFO L226 Difference]: Without dead ends: 458 [2022-02-20 18:30:09,363 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 18:30:09,364 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 76 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 310 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 18:30:09,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 310 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-02-20 18:30:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2022-02-20 18:30:09,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:09,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand has 456 states, 455 states have (on average 1.5186813186813186) internal successors, (691), 455 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,387 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand has 456 states, 455 states have (on average 1.5186813186813186) internal successors, (691), 455 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,388 INFO L87 Difference]: Start difference. First operand 458 states. Second operand has 456 states, 455 states have (on average 1.5186813186813186) internal successors, (691), 455 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:09,402 INFO L93 Difference]: Finished difference Result 458 states and 692 transitions. [2022-02-20 18:30:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 692 transitions. [2022-02-20 18:30:09,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:09,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:09,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 456 states, 455 states have (on average 1.5186813186813186) internal successors, (691), 455 states have internal predecessors, (691), 0 states have call successors, (0), 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 458 states. [2022-02-20 18:30:09,405 INFO L87 Difference]: Start difference. First operand has 456 states, 455 states have (on average 1.5186813186813186) internal successors, (691), 455 states have internal predecessors, (691), 0 states have call successors, (0), 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 458 states. [2022-02-20 18:30:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:09,418 INFO L93 Difference]: Finished difference Result 458 states and 692 transitions. [2022-02-20 18:30:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 692 transitions. [2022-02-20 18:30:09,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:09,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:09,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:09,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.5186813186813186) internal successors, (691), 455 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 691 transitions. [2022-02-20 18:30:09,435 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 691 transitions. Word has length 76 [2022-02-20 18:30:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:09,435 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 691 transitions. [2022-02-20 18:30:09,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 691 transitions. [2022-02-20 18:30:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:09,437 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:09,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:09,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:30:09,437 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:09,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:09,438 INFO L85 PathProgramCache]: Analyzing trace with hash 100818560, now seen corresponding path program 1 times [2022-02-20 18:30:09,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:09,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812226111] [2022-02-20 18:30:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:09,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:09,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {5465#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {5465#true} is VALID [2022-02-20 18:30:09,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {5465#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5465#true} is VALID [2022-02-20 18:30:09,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {5465#true} assume 0 == ~r1~0 % 256; {5465#true} is VALID [2022-02-20 18:30:09,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {5465#true} assume ~id1~0 >= 0; {5465#true} is VALID [2022-02-20 18:30:09,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {5465#true} assume 0 == ~st1~0; {5465#true} is VALID [2022-02-20 18:30:09,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {5465#true} assume ~send1~0 == ~id1~0; {5465#true} is VALID [2022-02-20 18:30:09,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {5465#true} assume 0 == ~mode1~0 % 256; {5465#true} is VALID [2022-02-20 18:30:09,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {5465#true} assume ~id2~0 >= 0; {5465#true} is VALID [2022-02-20 18:30:09,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {5465#true} assume 0 == ~st2~0; {5465#true} is VALID [2022-02-20 18:30:09,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {5465#true} assume ~send2~0 == ~id2~0; {5465#true} is VALID [2022-02-20 18:30:09,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {5465#true} assume 0 == ~mode2~0 % 256; {5465#true} is VALID [2022-02-20 18:30:09,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {5465#true} assume ~id3~0 >= 0; {5465#true} is VALID [2022-02-20 18:30:09,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {5465#true} assume 0 == ~st3~0; {5465#true} is VALID [2022-02-20 18:30:09,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {5465#true} assume ~send3~0 == ~id3~0; {5465#true} is VALID [2022-02-20 18:30:09,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {5465#true} assume 0 == ~mode3~0 % 256; {5465#true} is VALID [2022-02-20 18:30:09,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {5465#true} assume ~id4~0 >= 0; {5465#true} is VALID [2022-02-20 18:30:09,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {5465#true} assume 0 == ~st4~0; {5465#true} is VALID [2022-02-20 18:30:09,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {5465#true} assume ~send4~0 == ~id4~0; {5465#true} is VALID [2022-02-20 18:30:09,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {5465#true} assume 0 == ~mode4~0 % 256; {5465#true} is VALID [2022-02-20 18:30:09,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {5465#true} assume ~id5~0 >= 0; {5465#true} is VALID [2022-02-20 18:30:09,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {5465#true} assume 0 == ~st5~0; {5465#true} is VALID [2022-02-20 18:30:09,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {5465#true} assume ~send5~0 == ~id5~0; {5465#true} is VALID [2022-02-20 18:30:09,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {5465#true} assume 0 == ~mode5~0 % 256; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,543 INFO L290 TraceCheckUtils]: 55: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,543 INFO L290 TraceCheckUtils]: 56: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,544 INFO L290 TraceCheckUtils]: 57: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,544 INFO L290 TraceCheckUtils]: 58: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,546 INFO L290 TraceCheckUtils]: 60: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,546 INFO L290 TraceCheckUtils]: 61: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:09,547 INFO L290 TraceCheckUtils]: 63: Hoare triple {5467#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5466#false} is VALID [2022-02-20 18:30:09,548 INFO L290 TraceCheckUtils]: 64: Hoare triple {5466#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5466#false} is VALID [2022-02-20 18:30:09,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {5466#false} ~mode5~0 := 0; {5466#false} is VALID [2022-02-20 18:30:09,548 INFO L290 TraceCheckUtils]: 66: Hoare triple {5466#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5466#false} is VALID [2022-02-20 18:30:09,548 INFO L290 TraceCheckUtils]: 67: Hoare triple {5466#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5466#false} is VALID [2022-02-20 18:30:09,548 INFO L290 TraceCheckUtils]: 68: Hoare triple {5466#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5466#false} is VALID [2022-02-20 18:30:09,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {5466#false} ~mode6~0 := 0; {5466#false} is VALID [2022-02-20 18:30:09,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {5466#false} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5466#false} is VALID [2022-02-20 18:30:09,554 INFO L290 TraceCheckUtils]: 71: Hoare triple {5466#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {5466#false} is VALID [2022-02-20 18:30:09,555 INFO L290 TraceCheckUtils]: 72: Hoare triple {5466#false} check_#res#1 := check_~tmp~1#1; {5466#false} is VALID [2022-02-20 18:30:09,563 INFO L290 TraceCheckUtils]: 73: Hoare triple {5466#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5466#false} is VALID [2022-02-20 18:30:09,565 INFO L290 TraceCheckUtils]: 74: Hoare triple {5466#false} assume 0 == assert_~arg#1 % 256; {5466#false} is VALID [2022-02-20 18:30:09,565 INFO L290 TraceCheckUtils]: 75: Hoare triple {5466#false} assume !false; {5466#false} is VALID [2022-02-20 18:30:09,565 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 18:30:09,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:09,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812226111] [2022-02-20 18:30:09,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812226111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:09,566 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:09,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:09,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938645915] [2022-02-20 18:30:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:09,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:09,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:09,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:09,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:09,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:09,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:09,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:09,621 INFO L87 Difference]: Start difference. First operand 456 states and 691 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:09,899 INFO L93 Difference]: Finished difference Result 1228 states and 1901 transitions. [2022-02-20 18:30:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:09,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:09,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 330 transitions. [2022-02-20 18:30:10,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:10,176 INFO L225 Difference]: With dead ends: 1228 [2022-02-20 18:30:10,176 INFO L226 Difference]: Without dead ends: 818 [2022-02-20 18:30:10,177 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 18:30:10,178 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 309 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 18:30:10,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 309 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-02-20 18:30:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 816. [2022-02-20 18:30:10,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:10,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 818 states. Second operand has 816 states, 815 states have (on average 1.5300613496932516) internal successors, (1247), 815 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,212 INFO L74 IsIncluded]: Start isIncluded. First operand 818 states. Second operand has 816 states, 815 states have (on average 1.5300613496932516) internal successors, (1247), 815 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,213 INFO L87 Difference]: Start difference. First operand 818 states. Second operand has 816 states, 815 states have (on average 1.5300613496932516) internal successors, (1247), 815 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:10,247 INFO L93 Difference]: Finished difference Result 818 states and 1248 transitions. [2022-02-20 18:30:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1248 transitions. [2022-02-20 18:30:10,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:10,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:10,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 816 states, 815 states have (on average 1.5300613496932516) internal successors, (1247), 815 states have internal predecessors, (1247), 0 states have call successors, (0), 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 818 states. [2022-02-20 18:30:10,252 INFO L87 Difference]: Start difference. First operand has 816 states, 815 states have (on average 1.5300613496932516) internal successors, (1247), 815 states have internal predecessors, (1247), 0 states have call successors, (0), 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 818 states. [2022-02-20 18:30:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:10,284 INFO L93 Difference]: Finished difference Result 818 states and 1248 transitions. [2022-02-20 18:30:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1248 transitions. [2022-02-20 18:30:10,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:10,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:10,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:10,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 1.5300613496932516) internal successors, (1247), 815 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1247 transitions. [2022-02-20 18:30:10,326 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1247 transitions. Word has length 76 [2022-02-20 18:30:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:10,327 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1247 transitions. [2022-02-20 18:30:10,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1247 transitions. [2022-02-20 18:30:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:10,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:10,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:10,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:30:10,329 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash 438611702, now seen corresponding path program 1 times [2022-02-20 18:30:10,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:10,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581654689] [2022-02-20 18:30:10,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:10,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:10,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {9512#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {9512#true} is VALID [2022-02-20 18:30:10,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {9512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {9512#true} is VALID [2022-02-20 18:30:10,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {9512#true} assume 0 == ~r1~0 % 256; {9512#true} is VALID [2022-02-20 18:30:10,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {9512#true} assume ~id1~0 >= 0; {9512#true} is VALID [2022-02-20 18:30:10,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {9512#true} assume 0 == ~st1~0; {9512#true} is VALID [2022-02-20 18:30:10,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {9512#true} assume ~send1~0 == ~id1~0; {9512#true} is VALID [2022-02-20 18:30:10,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {9512#true} assume 0 == ~mode1~0 % 256; {9512#true} is VALID [2022-02-20 18:30:10,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {9512#true} assume ~id2~0 >= 0; {9512#true} is VALID [2022-02-20 18:30:10,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {9512#true} assume 0 == ~st2~0; {9512#true} is VALID [2022-02-20 18:30:10,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {9512#true} assume ~send2~0 == ~id2~0; {9512#true} is VALID [2022-02-20 18:30:10,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {9512#true} assume 0 == ~mode2~0 % 256; {9512#true} is VALID [2022-02-20 18:30:10,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {9512#true} assume ~id3~0 >= 0; {9512#true} is VALID [2022-02-20 18:30:10,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {9512#true} assume 0 == ~st3~0; {9512#true} is VALID [2022-02-20 18:30:10,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {9512#true} assume ~send3~0 == ~id3~0; {9512#true} is VALID [2022-02-20 18:30:10,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {9512#true} assume 0 == ~mode3~0 % 256; {9512#true} is VALID [2022-02-20 18:30:10,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {9512#true} assume ~id4~0 >= 0; {9512#true} is VALID [2022-02-20 18:30:10,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {9512#true} assume 0 == ~st4~0; {9512#true} is VALID [2022-02-20 18:30:10,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {9512#true} assume ~send4~0 == ~id4~0; {9512#true} is VALID [2022-02-20 18:30:10,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {9512#true} assume 0 == ~mode4~0 % 256; {9512#true} is VALID [2022-02-20 18:30:10,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {9512#true} assume ~id5~0 >= 0; {9512#true} is VALID [2022-02-20 18:30:10,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {9512#true} assume 0 == ~st5~0; {9512#true} is VALID [2022-02-20 18:30:10,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {9512#true} assume ~send5~0 == ~id5~0; {9512#true} is VALID [2022-02-20 18:30:10,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {9512#true} assume 0 == ~mode5~0 % 256; {9512#true} is VALID [2022-02-20 18:30:10,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {9512#true} assume ~id6~0 >= 0; {9512#true} is VALID [2022-02-20 18:30:10,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {9512#true} assume 0 == ~st6~0; {9512#true} is VALID [2022-02-20 18:30:10,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {9512#true} assume ~send6~0 == ~id6~0; {9512#true} is VALID [2022-02-20 18:30:10,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {9512#true} assume 0 == ~mode6~0 % 256; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,426 INFO L290 TraceCheckUtils]: 55: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,429 INFO L290 TraceCheckUtils]: 63: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:10,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {9514#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {9513#false} is VALID [2022-02-20 18:30:10,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {9513#false} assume !(node6_~m6~0#1 != ~nomsg~0); {9513#false} is VALID [2022-02-20 18:30:10,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {9513#false} ~mode6~0 := 0; {9513#false} is VALID [2022-02-20 18:30:10,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {9513#false} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9513#false} is VALID [2022-02-20 18:30:10,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {9513#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {9513#false} is VALID [2022-02-20 18:30:10,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {9513#false} check_#res#1 := check_~tmp~1#1; {9513#false} is VALID [2022-02-20 18:30:10,432 INFO L290 TraceCheckUtils]: 73: Hoare triple {9513#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {9513#false} is VALID [2022-02-20 18:30:10,432 INFO L290 TraceCheckUtils]: 74: Hoare triple {9513#false} assume 0 == assert_~arg#1 % 256; {9513#false} is VALID [2022-02-20 18:30:10,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {9513#false} assume !false; {9513#false} is VALID [2022-02-20 18:30:10,433 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 18:30:10,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:10,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581654689] [2022-02-20 18:30:10,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581654689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:10,433 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:10,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:10,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845199167] [2022-02-20 18:30:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:10,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:10,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:10,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:10,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:10,494 INFO L87 Difference]: Start difference. First operand 816 states and 1247 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:10,963 INFO L93 Difference]: Finished difference Result 2260 states and 3489 transitions. [2022-02-20 18:30:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:10,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-02-20 18:30:10,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 330 transitions. [2022-02-20 18:30:11,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:11,282 INFO L225 Difference]: With dead ends: 2260 [2022-02-20 18:30:11,282 INFO L226 Difference]: Without dead ends: 1490 [2022-02-20 18:30:11,283 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 18:30:11,283 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 68 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 308 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 18:30:11,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 308 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-02-20 18:30:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1488. [2022-02-20 18:30:11,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:11,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1490 states. Second operand has 1488 states, 1487 states have (on average 1.527236045729657) internal successors, (2271), 1487 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,340 INFO L74 IsIncluded]: Start isIncluded. First operand 1490 states. Second operand has 1488 states, 1487 states have (on average 1.527236045729657) internal successors, (2271), 1487 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,342 INFO L87 Difference]: Start difference. First operand 1490 states. Second operand has 1488 states, 1487 states have (on average 1.527236045729657) internal successors, (2271), 1487 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:11,434 INFO L93 Difference]: Finished difference Result 1490 states and 2272 transitions. [2022-02-20 18:30:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2272 transitions. [2022-02-20 18:30:11,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:11,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:11,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 1488 states, 1487 states have (on average 1.527236045729657) internal successors, (2271), 1487 states have internal predecessors, (2271), 0 states have call successors, (0), 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 1490 states. [2022-02-20 18:30:11,442 INFO L87 Difference]: Start difference. First operand has 1488 states, 1487 states have (on average 1.527236045729657) internal successors, (2271), 1487 states have internal predecessors, (2271), 0 states have call successors, (0), 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 1490 states. [2022-02-20 18:30:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:11,535 INFO L93 Difference]: Finished difference Result 1490 states and 2272 transitions. [2022-02-20 18:30:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2272 transitions. [2022-02-20 18:30:11,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:11,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:11,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:11,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1487 states have (on average 1.527236045729657) internal successors, (2271), 1487 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2271 transitions. [2022-02-20 18:30:11,662 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2271 transitions. Word has length 76 [2022-02-20 18:30:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:11,662 INFO L470 AbstractCegarLoop]: Abstraction has 1488 states and 2271 transitions. [2022-02-20 18:30:11,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2271 transitions. [2022-02-20 18:30:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:11,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:11,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:11,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:30:11,664 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1656597100, now seen corresponding path program 1 times [2022-02-20 18:30:11,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:11,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113442935] [2022-02-20 18:30:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:11,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {16967#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {16967#true} is VALID [2022-02-20 18:30:11,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {16967#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16967#true} is VALID [2022-02-20 18:30:11,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {16967#true} assume 0 == ~r1~0 % 256; {16967#true} is VALID [2022-02-20 18:30:11,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {16967#true} assume ~id1~0 >= 0; {16967#true} is VALID [2022-02-20 18:30:11,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {16967#true} assume 0 == ~st1~0; {16969#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:11,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {16969#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {16969#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:11,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {16969#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {16969#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:11,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {16969#(<= ~st1~0 0)} assume ~id2~0 >= 0; {16969#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:11,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {16969#(<= ~st1~0 0)} assume 0 == ~st2~0; {16970#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {16970#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {16970#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {16970#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {16970#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {16970#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {16970#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {16970#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {16971#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {16971#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {16971#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {16971#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {16971#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {16971#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {16971#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {16971#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {16972#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {16972#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {16972#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {16972#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {16972#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {16972#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {16972#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {16972#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {16973#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {16973#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {16973#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {16973#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {16973#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {16973#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {16973#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {16973#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,799 INFO L290 TraceCheckUtils]: 54: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:11,806 INFO L290 TraceCheckUtils]: 71: Hoare triple {16974#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {16968#false} is VALID [2022-02-20 18:30:11,807 INFO L290 TraceCheckUtils]: 72: Hoare triple {16968#false} check_#res#1 := check_~tmp~1#1; {16968#false} is VALID [2022-02-20 18:30:11,807 INFO L290 TraceCheckUtils]: 73: Hoare triple {16968#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16968#false} is VALID [2022-02-20 18:30:11,807 INFO L290 TraceCheckUtils]: 74: Hoare triple {16968#false} assume 0 == assert_~arg#1 % 256; {16968#false} is VALID [2022-02-20 18:30:11,807 INFO L290 TraceCheckUtils]: 75: Hoare triple {16968#false} assume !false; {16968#false} is VALID [2022-02-20 18:30:11,808 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 18:30:11,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:11,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113442935] [2022-02-20 18:30:11,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113442935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:11,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:11,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:30:11,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110707431] [2022-02-20 18:30:11,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:11,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:11,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:11,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:30:11,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:11,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:30:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:30:11,866 INFO L87 Difference]: Start difference. First operand 1488 states and 2271 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:30,849 INFO L93 Difference]: Finished difference Result 18792 states and 28971 transitions. [2022-02-20 18:30:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:30:30,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1320 transitions. [2022-02-20 18:30:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1320 transitions. [2022-02-20 18:30:30,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 1320 transitions. [2022-02-20 18:30:31,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1320 edges. 1320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:41,612 INFO L225 Difference]: With dead ends: 18792 [2022-02-20 18:30:41,612 INFO L226 Difference]: Without dead ends: 17350 [2022-02-20 18:30:41,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:30:41,618 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 1919 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:41,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1919 Valid, 1953 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17350 states. [2022-02-20 18:30:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17350 to 2928. [2022-02-20 18:30:43,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:43,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17350 states. Second operand has 2928 states, 2927 states have (on average 1.5138366928595832) internal successors, (4431), 2927 states have internal predecessors, (4431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:43,419 INFO L74 IsIncluded]: Start isIncluded. First operand 17350 states. Second operand has 2928 states, 2927 states have (on average 1.5138366928595832) internal successors, (4431), 2927 states have internal predecessors, (4431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:43,423 INFO L87 Difference]: Start difference. First operand 17350 states. Second operand has 2928 states, 2927 states have (on average 1.5138366928595832) internal successors, (4431), 2927 states have internal predecessors, (4431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:51,471 INFO L93 Difference]: Finished difference Result 17350 states and 26362 transitions. [2022-02-20 18:30:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 17350 states and 26362 transitions. [2022-02-20 18:30:51,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:51,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:51,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 2928 states, 2927 states have (on average 1.5138366928595832) internal successors, (4431), 2927 states have internal predecessors, (4431), 0 states have call successors, (0), 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 17350 states. [2022-02-20 18:30:51,508 INFO L87 Difference]: Start difference. First operand has 2928 states, 2927 states have (on average 1.5138366928595832) internal successors, (4431), 2927 states have internal predecessors, (4431), 0 states have call successors, (0), 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 17350 states. [2022-02-20 18:30:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,106 INFO L93 Difference]: Finished difference Result 17350 states and 26362 transitions. [2022-02-20 18:30:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 17350 states and 26362 transitions. [2022-02-20 18:30:59,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:59,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:59,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:59,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2927 states have (on average 1.5138366928595832) internal successors, (4431), 2927 states have internal predecessors, (4431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 4431 transitions. [2022-02-20 18:30:59,496 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 4431 transitions. Word has length 76 [2022-02-20 18:30:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:59,496 INFO L470 AbstractCegarLoop]: Abstraction has 2928 states and 4431 transitions. [2022-02-20 18:30:59,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 4431 transitions. [2022-02-20 18:30:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:59,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:59,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:59,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:30:59,497 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1436220828, now seen corresponding path program 1 times [2022-02-20 18:30:59,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:59,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35831894] [2022-02-20 18:30:59,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:59,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:59,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {77738#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(34, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {77738#true} is VALID [2022-02-20 18:30:59,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {77738#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {77738#true} is VALID [2022-02-20 18:30:59,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {77738#true} assume 0 == ~r1~0 % 256; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id6~0 >= 0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st6~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send6~0 == ~id6~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode6~0 % 256; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id6~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id6~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id6~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id6~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {77740#(<= ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,590 INFO L290 TraceCheckUtils]: 54: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode6~0 % 256); {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:59,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {77740#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 6; {77739#false} is VALID [2022-02-20 18:30:59,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {77739#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {77739#false} is VALID [2022-02-20 18:30:59,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {77739#false} check_#res#1 := check_~tmp~1#1; {77739#false} is VALID [2022-02-20 18:30:59,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {77739#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {77739#false} is VALID [2022-02-20 18:30:59,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {77739#false} assume 0 == assert_~arg#1 % 256; {77739#false} is VALID [2022-02-20 18:30:59,597 INFO L290 TraceCheckUtils]: 77: Hoare triple {77739#false} assume !false; {77739#false} is VALID [2022-02-20 18:30:59,598 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 18:30:59,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:59,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35831894] [2022-02-20 18:30:59,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35831894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:59,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:59,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:59,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063514959] [2022-02-20 18:30:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:59,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:59,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:59,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:59,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:59,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:59,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:59,657 INFO L87 Difference]: Start difference. First operand 2928 states and 4431 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:05,204 INFO L93 Difference]: Finished difference Result 8340 states and 12593 transitions. [2022-02-20 18:31:05,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:31:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-02-20 18:31:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-02-20 18:31:05,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 331 transitions. [2022-02-20 18:31:05,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:06,351 INFO L225 Difference]: With dead ends: 8340 [2022-02-20 18:31:06,351 INFO L226 Difference]: Without dead ends: 5458 [2022-02-20 18:31:06,354 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 18:31:06,355 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 232 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 18:31:06,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 232 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2022-02-20 18:31:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 5392. [2022-02-20 18:31:09,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:09,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5458 states. Second operand has 5392 states, 5391 states have (on average 1.4808013355592655) internal successors, (7983), 5391 states have internal predecessors, (7983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:09,649 INFO L74 IsIncluded]: Start isIncluded. First operand 5458 states. Second operand has 5392 states, 5391 states have (on average 1.4808013355592655) internal successors, (7983), 5391 states have internal predecessors, (7983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:09,657 INFO L87 Difference]: Start difference. First operand 5458 states. Second operand has 5392 states, 5391 states have (on average 1.4808013355592655) internal successors, (7983), 5391 states have internal predecessors, (7983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)