./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.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-var-start-time.6.ufo.BOUNDED-12.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 a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:28:38,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:28:38,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:28:38,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:28:38,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:28:38,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:28:38,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:28:38,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:28:38,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:28:38,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:28:38,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:28:38,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:28:38,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:28:38,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:28:38,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:28:38,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:28:38,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:28:38,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:28:38,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:28:38,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:28:38,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:28:38,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:28:38,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:28:38,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:28:38,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:28:38,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:28:38,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:28:38,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:28:38,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:28:38,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:28:38,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:28:38,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:28:38,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:28:38,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:28:38,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:28:38,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:28:38,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:28:38,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:28:38,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:28:38,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:28:38,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:28:38,571 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:28:38,595 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:28:38,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:28:38,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:28:38,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:28:38,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:28:38,597 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:28:38,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:28:38,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:28:38,598 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:28:38,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:28:38,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:28:38,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:28:38,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:28:38,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:28:38,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:28:38,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:28:38,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:28:38,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:28:38,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:28:38,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:28:38,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:28:38,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:28:38,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:28:38,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:28:38,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:38,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:28:38,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:28:38,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:28:38,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:28:38,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:28:38,602 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:28:38,602 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:28:38,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:28:38,602 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 -> a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a [2022-02-20 18:28:38,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:28:38,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:28:38,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:28:38,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:28:38,806 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:28:38,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2022-02-20 18:28:38,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70d458c6/52eb00cccbc8406aaf146844c2bbf067/FLAG3dd18c62d [2022-02-20 18:28:39,169 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:28:39,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2022-02-20 18:28:39,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70d458c6/52eb00cccbc8406aaf146844c2bbf067/FLAG3dd18c62d [2022-02-20 18:28:39,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70d458c6/52eb00cccbc8406aaf146844c2bbf067 [2022-02-20 18:28:39,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:28:39,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:28:39,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:39,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:28:39,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:28:39,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a79e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39, skipping insertion in model container [2022-02-20 18:28:39,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:28:39,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:28:39,768 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-var-start-time.6.ufo.BOUNDED-12.pals.c[16936,16949] [2022-02-20 18:28:39,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:39,776 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:28:39,815 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-var-start-time.6.ufo.BOUNDED-12.pals.c[16936,16949] [2022-02-20 18:28:39,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:39,828 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:28:39,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39 WrapperNode [2022-02-20 18:28:39,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:39,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:39,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:28:39,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:28:39,833 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:28:39" (1/1) ... [2022-02-20 18:28:39,840 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:28:39" (1/1) ... [2022-02-20 18:28:39,880 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 461 [2022-02-20 18:28:39,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:39,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:28:39,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:28:39,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:28:39,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:28:39,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:28:39,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:28:39,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:28:39,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (1/1) ... [2022-02-20 18:28:39,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:39,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:28:39,961 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:28:39,965 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:28:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:28:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:28:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:28:39,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:28:40,052 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:28:40,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:28:40,648 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:28:40,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:28:40,656 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:28:40,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:40 BoogieIcfgContainer [2022-02-20 18:28:40,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:28:40,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:28:40,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:28:40,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:28:40,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:28:39" (1/3) ... [2022-02-20 18:28:40,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6ab60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:40, skipping insertion in model container [2022-02-20 18:28:40,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:39" (2/3) ... [2022-02-20 18:28:40,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6ab60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:40, skipping insertion in model container [2022-02-20 18:28:40,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:40" (3/3) ... [2022-02-20 18:28:40,665 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2022-02-20 18:28:40,669 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:28:40,670 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:28:40,709 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:28:40,718 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:28:40,718 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:28:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have 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:28:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:28:40,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:40,752 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:28:40,753 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:40,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1929732074, now seen corresponding path program 1 times [2022-02-20 18:28:40,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:40,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648590230] [2022-02-20 18:28:40,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:40,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:40,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#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(48, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~0 := 0; {148#true} is VALID [2022-02-20 18:28:40,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {148#true} is VALID [2022-02-20 18:28:40,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {150#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:28:40,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {151#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:28:40,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {152#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:28:40,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {149#false} is VALID [2022-02-20 18:28:40,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {149#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; {149#false} is VALID [2022-02-20 18:28:40,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {149#false} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {149#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {149#false} assume !(node1_~m1~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:40,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {149#false} ~mode1~0 := 0; {149#false} is VALID [2022-02-20 18:28:40,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {149#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {149#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#false} assume !(node2_~m2~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:40,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {149#false} ~mode2~0 := 0; {149#false} is VALID [2022-02-20 18:28:40,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {149#false} assume !(node3_~m3~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:40,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {149#false} ~mode3~0 := 0; {149#false} is VALID [2022-02-20 18:28:40,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {149#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {149#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {149#false} assume !(node4_~m4~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:40,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {149#false} ~mode4~0 := 0; {149#false} is VALID [2022-02-20 18:28:40,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {149#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {149#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {149#false} assume !(node5_~m5~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:40,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {149#false} ~mode5~0 := 0; {149#false} is VALID [2022-02-20 18:28:40,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {149#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {149#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:40,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {149#false} assume !(node6_~m6~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:40,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {149#false} ~mode6~0 := 0; {149#false} is VALID [2022-02-20 18:28:40,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {149#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; {149#false} is VALID [2022-02-20 18:28:40,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {149#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {149#false} is VALID [2022-02-20 18:28:40,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {149#false} check_#res#1 := check_~tmp~1#1; {149#false} is VALID [2022-02-20 18:28:40,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {149#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {149#false} is VALID [2022-02-20 18:28:40,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {149#false} assume 0 == assert_~arg#1 % 256; {149#false} is VALID [2022-02-20 18:28:40,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {149#false} assume !false; {149#false} is VALID [2022-02-20 18:28:41,000 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:28:41,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:41,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648590230] [2022-02-20 18:28:41,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648590230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:41,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:41,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:41,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214987236] [2022-02-20 18:28:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:41,010 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:28:41,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:41,013 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:28:41,042 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:28:41,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:41,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:41,062 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 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 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:28:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:41,461 INFO L93 Difference]: Finished difference Result 247 states and 408 transitions. [2022-02-20 18:28:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:28:41,462 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:28:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:41,463 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:28:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-02-20 18:28:41,471 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:28:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-02-20 18:28:41,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 408 transitions. [2022-02-20 18:28:41,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:41,721 INFO L225 Difference]: With dead ends: 247 [2022-02-20 18:28:41,721 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 18:28:41,723 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:28:41,726 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 3 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:41,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 920 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 18:28:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-20 18:28:41,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:41,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:28:41,757 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:28:41,758 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:28:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:41,772 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2022-02-20 18:28:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2022-02-20 18:28:41,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:41,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:41,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 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 141 states. [2022-02-20 18:28:41,779 INFO L87 Difference]: Start difference. First operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 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 141 states. [2022-02-20 18:28:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:41,786 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2022-02-20 18:28:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2022-02-20 18:28:41,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:41,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:41,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:41,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:28:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2022-02-20 18:28:41,794 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 37 [2022-02-20 18:28:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:41,794 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2022-02-20 18:28:41,795 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:28:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2022-02-20 18:28:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:28:41,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:41,798 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] [2022-02-20 18:28:41,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:28:41,798 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:41,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2008203596, now seen corresponding path program 1 times [2022-02-20 18:28:41,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:41,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277971331] [2022-02-20 18:28:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:41,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {858#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(48, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~0 := 0; {858#true} is VALID [2022-02-20 18:28:41,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {858#true} is VALID [2022-02-20 18:28:41,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume 0 == ~r1~0; {858#true} is VALID [2022-02-20 18:28:41,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {858#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {858#true} is VALID [2022-02-20 18:28:41,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {858#true} assume ~id1~0 >= 0; {858#true} is VALID [2022-02-20 18:28:41,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#true} assume 0 == ~st1~0; {858#true} is VALID [2022-02-20 18:28:41,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {858#true} assume ~send1~0 == ~id1~0; {858#true} is VALID [2022-02-20 18:28:41,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {858#true} assume 0 == ~mode1~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~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; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:41,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {859#false} assume !(node1_~m1~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:41,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {859#false} ~mode1~0 := 0; {859#false} is VALID [2022-02-20 18:28:41,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {859#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {859#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {859#false} assume !(node2_~m2~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:41,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {859#false} ~mode2~0 := 0; {859#false} is VALID [2022-02-20 18:28:41,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {859#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {859#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {859#false} assume !(node3_~m3~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:41,952 INFO L290 TraceCheckUtils]: 58: Hoare triple {859#false} ~mode3~0 := 0; {859#false} is VALID [2022-02-20 18:28:41,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {859#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,952 INFO L290 TraceCheckUtils]: 60: Hoare triple {859#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {859#false} assume !(node4_~m4~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:41,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {859#false} ~mode4~0 := 0; {859#false} is VALID [2022-02-20 18:28:41,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {859#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {859#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {859#false} assume !(node5_~m5~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:41,953 INFO L290 TraceCheckUtils]: 66: Hoare triple {859#false} ~mode5~0 := 0; {859#false} is VALID [2022-02-20 18:28:41,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {859#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {859#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:41,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {859#false} assume !(node6_~m6~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:41,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {859#false} ~mode6~0 := 0; {859#false} is VALID [2022-02-20 18:28:41,954 INFO L290 TraceCheckUtils]: 71: Hoare triple {859#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; {859#false} is VALID [2022-02-20 18:28:41,954 INFO L290 TraceCheckUtils]: 72: Hoare triple {859#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {859#false} is VALID [2022-02-20 18:28:41,955 INFO L290 TraceCheckUtils]: 73: Hoare triple {859#false} check_#res#1 := check_~tmp~1#1; {859#false} is VALID [2022-02-20 18:28:41,955 INFO L290 TraceCheckUtils]: 74: Hoare triple {859#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {859#false} is VALID [2022-02-20 18:28:41,955 INFO L290 TraceCheckUtils]: 75: Hoare triple {859#false} assume 0 == assert_~arg#1 % 256; {859#false} is VALID [2022-02-20 18:28:41,955 INFO L290 TraceCheckUtils]: 76: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-02-20 18:28:41,956 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:28:41,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:41,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277971331] [2022-02-20 18:28:41,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277971331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:41,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:41,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:41,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244515912] [2022-02-20 18:28:41,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:41,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:28:41,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:41,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:28:42,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:42,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:42,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:42,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:42,002 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:28:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:42,233 INFO L93 Difference]: Finished difference Result 317 states and 480 transitions. [2022-02-20 18:28:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:42,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:28:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:28:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:28:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:42,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:42,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:42,538 INFO L225 Difference]: With dead ends: 317 [2022-02-20 18:28:42,538 INFO L226 Difference]: Without dead ends: 223 [2022-02-20 18:28:42,538 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:28:42,539 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 139 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 467 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:28:42,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 467 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-02-20 18:28:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2022-02-20 18:28:42,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:42,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:28:42,548 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:28:42,549 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:28:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:42,554 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2022-02-20 18:28:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2022-02-20 18:28:42,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:42,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:42,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 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 223 states. [2022-02-20 18:28:42,555 INFO L87 Difference]: Start difference. First operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 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 223 states. [2022-02-20 18:28:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:42,560 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2022-02-20 18:28:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2022-02-20 18:28:42,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:42,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:42,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:42,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:28:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 327 transitions. [2022-02-20 18:28:42,566 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 327 transitions. Word has length 77 [2022-02-20 18:28:42,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:42,567 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 327 transitions. [2022-02-20 18:28:42,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:28:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 327 transitions. [2022-02-20 18:28:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:28:42,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:42,568 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:28:42,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:28:42,568 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:42,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:42,569 INFO L85 PathProgramCache]: Analyzing trace with hash 823495780, now seen corresponding path program 1 times [2022-02-20 18:28:42,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:42,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450674230] [2022-02-20 18:28:42,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:42,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:42,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {1889#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(48, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~0 := 0; {1889#true} is VALID [2022-02-20 18:28:42,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {1889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1889#true} is VALID [2022-02-20 18:28:42,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {1889#true} assume 0 == ~r1~0; {1889#true} is VALID [2022-02-20 18:28:42,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {1889#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1889#true} is VALID [2022-02-20 18:28:42,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {1889#true} assume ~id1~0 >= 0; {1889#true} is VALID [2022-02-20 18:28:42,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {1889#true} assume 0 == ~st1~0; {1889#true} is VALID [2022-02-20 18:28:42,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {1889#true} assume ~send1~0 == ~id1~0; {1889#true} is VALID [2022-02-20 18:28:42,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {1889#true} assume 0 == ~mode1~0 % 256; {1889#true} is VALID [2022-02-20 18:28:42,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {1889#true} assume ~id2~0 >= 0; {1889#true} is VALID [2022-02-20 18:28:42,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {1889#true} assume 0 == ~st2~0; {1889#true} is VALID [2022-02-20 18:28:42,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {1889#true} assume ~send2~0 == ~id2~0; {1889#true} is VALID [2022-02-20 18:28:42,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {1889#true} assume 0 == ~mode2~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {1891#(= (+ (* (- 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; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,710 INFO L290 TraceCheckUtils]: 50: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {1891#(= (+ (* (- 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; {1890#false} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {1890#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 55: Hoare triple {1890#false} ~mode2~0 := 0; {1890#false} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {1890#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {1890#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {1890#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {1890#false} ~mode3~0 := 0; {1890#false} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 60: Hoare triple {1890#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:42,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {1890#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:42,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {1890#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:42,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {1890#false} ~mode4~0 := 0; {1890#false} is VALID [2022-02-20 18:28:42,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {1890#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:42,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {1890#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:42,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {1890#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:42,713 INFO L290 TraceCheckUtils]: 67: Hoare triple {1890#false} ~mode5~0 := 0; {1890#false} is VALID [2022-02-20 18:28:42,713 INFO L290 TraceCheckUtils]: 68: Hoare triple {1890#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:42,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {1890#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:42,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {1890#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:42,714 INFO L290 TraceCheckUtils]: 71: Hoare triple {1890#false} ~mode6~0 := 0; {1890#false} is VALID [2022-02-20 18:28:42,714 INFO L290 TraceCheckUtils]: 72: Hoare triple {1890#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; {1890#false} is VALID [2022-02-20 18:28:42,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {1890#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1890#false} is VALID [2022-02-20 18:28:42,714 INFO L290 TraceCheckUtils]: 74: Hoare triple {1890#false} check_#res#1 := check_~tmp~1#1; {1890#false} is VALID [2022-02-20 18:28:42,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {1890#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {1890#false} is VALID [2022-02-20 18:28:42,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {1890#false} assume 0 == assert_~arg#1 % 256; {1890#false} is VALID [2022-02-20 18:28:42,715 INFO L290 TraceCheckUtils]: 77: Hoare triple {1890#false} assume !false; {1890#false} is VALID [2022-02-20 18:28:42,715 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:28:42,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:42,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450674230] [2022-02-20 18:28:42,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450674230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:42,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:42,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:42,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285575930] [2022-02-20 18:28:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:42,717 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:28:42,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:42,717 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:28:42,758 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:28:42,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:42,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:42,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:42,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:42,760 INFO L87 Difference]: Start difference. First operand 221 states and 327 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:28:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:42,995 INFO L93 Difference]: Finished difference Result 545 states and 847 transitions. [2022-02-20 18:28:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:42,996 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:28:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:42,996 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:28:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:43,001 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:28:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:43,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:43,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:43,286 INFO L225 Difference]: With dead ends: 545 [2022-02-20 18:28:43,286 INFO L226 Difference]: Without dead ends: 371 [2022-02-20 18:28:43,287 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:28:43,288 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 134 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 458 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:28:43,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-02-20 18:28:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2022-02-20 18:28:43,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:43,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:28:43,300 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:28:43,301 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:28:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:43,309 INFO L93 Difference]: Finished difference Result 371 states and 565 transitions. [2022-02-20 18:28:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 565 transitions. [2022-02-20 18:28:43,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:43,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:43,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 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 371 states. [2022-02-20 18:28:43,311 INFO L87 Difference]: Start difference. First operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 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 371 states. [2022-02-20 18:28:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:43,319 INFO L93 Difference]: Finished difference Result 371 states and 565 transitions. [2022-02-20 18:28:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 565 transitions. [2022-02-20 18:28:43,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:43,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:43,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:43,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:28:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 564 transitions. [2022-02-20 18:28:43,329 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 564 transitions. Word has length 78 [2022-02-20 18:28:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:43,330 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 564 transitions. [2022-02-20 18:28:43,330 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 18:28:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 564 transitions. [2022-02-20 18:28:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:28:43,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:43,331 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, 1] [2022-02-20 18:28:43,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:28:43,331 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1276515004, now seen corresponding path program 1 times [2022-02-20 18:28:43,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:43,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669284809] [2022-02-20 18:28:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:43,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {3632#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(48, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~0 := 0; {3632#true} is VALID [2022-02-20 18:28:43,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {3632#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3632#true} is VALID [2022-02-20 18:28:43,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {3632#true} assume 0 == ~r1~0; {3632#true} is VALID [2022-02-20 18:28:43,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {3632#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {3632#true} is VALID [2022-02-20 18:28:43,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {3632#true} assume ~id1~0 >= 0; {3632#true} is VALID [2022-02-20 18:28:43,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {3632#true} assume 0 == ~st1~0; {3632#true} is VALID [2022-02-20 18:28:43,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {3632#true} assume ~send1~0 == ~id1~0; {3632#true} is VALID [2022-02-20 18:28:43,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {3632#true} assume 0 == ~mode1~0 % 256; {3632#true} is VALID [2022-02-20 18:28:43,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {3632#true} assume ~id2~0 >= 0; {3632#true} is VALID [2022-02-20 18:28:43,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#true} assume 0 == ~st2~0; {3632#true} is VALID [2022-02-20 18:28:43,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {3632#true} assume ~send2~0 == ~id2~0; {3632#true} is VALID [2022-02-20 18:28:43,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {3632#true} assume 0 == ~mode2~0 % 256; {3632#true} is VALID [2022-02-20 18:28:43,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {3632#true} assume ~id3~0 >= 0; {3632#true} is VALID [2022-02-20 18:28:43,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {3632#true} assume 0 == ~st3~0; {3632#true} is VALID [2022-02-20 18:28:43,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {3632#true} assume ~send3~0 == ~id3~0; {3632#true} is VALID [2022-02-20 18:28:43,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {3632#true} assume 0 == ~mode3~0 % 256; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {3634#(= (+ (* (- 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; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:43,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {3634#(= (+ (* (- 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; {3633#false} is VALID [2022-02-20 18:28:43,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {3633#false} assume !(node3_~m3~0#1 != ~nomsg~0); {3633#false} is VALID [2022-02-20 18:28:43,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {3633#false} ~mode3~0 := 0; {3633#false} is VALID [2022-02-20 18:28:43,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {3633#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:43,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {3633#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:43,411 INFO L290 TraceCheckUtils]: 63: Hoare triple {3633#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3633#false} is VALID [2022-02-20 18:28:43,411 INFO L290 TraceCheckUtils]: 64: Hoare triple {3633#false} ~mode4~0 := 0; {3633#false} is VALID [2022-02-20 18:28:43,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {3633#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:43,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {3633#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:43,411 INFO L290 TraceCheckUtils]: 67: Hoare triple {3633#false} assume !(node5_~m5~0#1 != ~nomsg~0); {3633#false} is VALID [2022-02-20 18:28:43,411 INFO L290 TraceCheckUtils]: 68: Hoare triple {3633#false} ~mode5~0 := 0; {3633#false} is VALID [2022-02-20 18:28:43,411 INFO L290 TraceCheckUtils]: 69: Hoare triple {3633#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:43,412 INFO L290 TraceCheckUtils]: 70: Hoare triple {3633#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:43,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {3633#false} assume !(node6_~m6~0#1 != ~nomsg~0); {3633#false} is VALID [2022-02-20 18:28:43,412 INFO L290 TraceCheckUtils]: 72: Hoare triple {3633#false} ~mode6~0 := 0; {3633#false} is VALID [2022-02-20 18:28:43,412 INFO L290 TraceCheckUtils]: 73: Hoare triple {3633#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; {3633#false} is VALID [2022-02-20 18:28:43,412 INFO L290 TraceCheckUtils]: 74: Hoare triple {3633#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {3633#false} is VALID [2022-02-20 18:28:43,412 INFO L290 TraceCheckUtils]: 75: Hoare triple {3633#false} check_#res#1 := check_~tmp~1#1; {3633#false} is VALID [2022-02-20 18:28:43,412 INFO L290 TraceCheckUtils]: 76: Hoare triple {3633#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {3633#false} is VALID [2022-02-20 18:28:43,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {3633#false} assume 0 == assert_~arg#1 % 256; {3633#false} is VALID [2022-02-20 18:28:43,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {3633#false} assume !false; {3633#false} is VALID [2022-02-20 18:28:43,413 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:28:43,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:43,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669284809] [2022-02-20 18:28:43,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669284809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:43,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:43,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:43,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812647192] [2022-02-20 18:28:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:43,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:28:43,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:43,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:28:43,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:43,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:43,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:43,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:43,458 INFO L87 Difference]: Start difference. First operand 369 states and 564 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:28:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:43,710 INFO L93 Difference]: Finished difference Result 965 states and 1518 transitions. [2022-02-20 18:28:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:28:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:28:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:28:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:43,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:43,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:43,998 INFO L225 Difference]: With dead ends: 965 [2022-02-20 18:28:43,999 INFO L226 Difference]: Without dead ends: 643 [2022-02-20 18:28:44,000 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:28:44,001 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 129 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 449 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:28:44,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 449 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-02-20 18:28:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2022-02-20 18:28:44,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:44,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:28:44,017 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:28:44,018 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:28:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:44,033 INFO L93 Difference]: Finished difference Result 643 states and 997 transitions. [2022-02-20 18:28:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 997 transitions. [2022-02-20 18:28:44,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:44,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:44,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 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 643 states. [2022-02-20 18:28:44,036 INFO L87 Difference]: Start difference. First operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 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 643 states. [2022-02-20 18:28:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:44,051 INFO L93 Difference]: Finished difference Result 643 states and 997 transitions. [2022-02-20 18:28:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 997 transitions. [2022-02-20 18:28:44,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:44,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:44,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:44,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:28:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 996 transitions. [2022-02-20 18:28:44,069 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 996 transitions. Word has length 79 [2022-02-20 18:28:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:44,069 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 996 transitions. [2022-02-20 18:28:44,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:28:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 996 transitions. [2022-02-20 18:28:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:28:44,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:44,070 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, 1, 1] [2022-02-20 18:28:44,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:28:44,070 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1327982836, now seen corresponding path program 1 times [2022-02-20 18:28:44,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:44,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195548237] [2022-02-20 18:28:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:44,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {6691#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(48, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~0 := 0; {6691#true} is VALID [2022-02-20 18:28:44,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {6691#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {6691#true} is VALID [2022-02-20 18:28:44,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {6691#true} assume 0 == ~r1~0; {6691#true} is VALID [2022-02-20 18:28:44,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {6691#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {6691#true} is VALID [2022-02-20 18:28:44,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {6691#true} assume ~id1~0 >= 0; {6691#true} is VALID [2022-02-20 18:28:44,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {6691#true} assume 0 == ~st1~0; {6691#true} is VALID [2022-02-20 18:28:44,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {6691#true} assume ~send1~0 == ~id1~0; {6691#true} is VALID [2022-02-20 18:28:44,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {6691#true} assume 0 == ~mode1~0 % 256; {6691#true} is VALID [2022-02-20 18:28:44,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {6691#true} assume ~id2~0 >= 0; {6691#true} is VALID [2022-02-20 18:28:44,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {6691#true} assume 0 == ~st2~0; {6691#true} is VALID [2022-02-20 18:28:44,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {6691#true} assume ~send2~0 == ~id2~0; {6691#true} is VALID [2022-02-20 18:28:44,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {6691#true} assume 0 == ~mode2~0 % 256; {6691#true} is VALID [2022-02-20 18:28:44,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {6691#true} assume ~id3~0 >= 0; {6691#true} is VALID [2022-02-20 18:28:44,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {6691#true} assume 0 == ~st3~0; {6691#true} is VALID [2022-02-20 18:28:44,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {6691#true} assume ~send3~0 == ~id3~0; {6691#true} is VALID [2022-02-20 18:28:44,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {6691#true} assume 0 == ~mode3~0 % 256; {6691#true} is VALID [2022-02-20 18:28:44,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {6691#true} assume ~id4~0 >= 0; {6691#true} is VALID [2022-02-20 18:28:44,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {6691#true} assume 0 == ~st4~0; {6691#true} is VALID [2022-02-20 18:28:44,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {6691#true} assume ~send4~0 == ~id4~0; {6691#true} is VALID [2022-02-20 18:28:44,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {6691#true} assume 0 == ~mode4~0 % 256; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {6693#(= (+ (* (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; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,169 INFO L290 TraceCheckUtils]: 59: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:44,170 INFO L290 TraceCheckUtils]: 63: Hoare triple {6693#(= (+ (* (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; {6692#false} is VALID [2022-02-20 18:28:44,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {6692#false} assume !(node4_~m4~0#1 != ~nomsg~0); {6692#false} is VALID [2022-02-20 18:28:44,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {6692#false} ~mode4~0 := 0; {6692#false} is VALID [2022-02-20 18:28:44,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {6692#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:44,171 INFO L290 TraceCheckUtils]: 67: Hoare triple {6692#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:44,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {6692#false} assume !(node5_~m5~0#1 != ~nomsg~0); {6692#false} is VALID [2022-02-20 18:28:44,171 INFO L290 TraceCheckUtils]: 69: Hoare triple {6692#false} ~mode5~0 := 0; {6692#false} is VALID [2022-02-20 18:28:44,171 INFO L290 TraceCheckUtils]: 70: Hoare triple {6692#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:44,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {6692#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:44,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {6692#false} assume !(node6_~m6~0#1 != ~nomsg~0); {6692#false} is VALID [2022-02-20 18:28:44,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {6692#false} ~mode6~0 := 0; {6692#false} is VALID [2022-02-20 18:28:44,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {6692#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; {6692#false} is VALID [2022-02-20 18:28:44,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {6692#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {6692#false} is VALID [2022-02-20 18:28:44,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {6692#false} check_#res#1 := check_~tmp~1#1; {6692#false} is VALID [2022-02-20 18:28:44,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {6692#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {6692#false} is VALID [2022-02-20 18:28:44,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {6692#false} assume 0 == assert_~arg#1 % 256; {6692#false} is VALID [2022-02-20 18:28:44,172 INFO L290 TraceCheckUtils]: 79: Hoare triple {6692#false} assume !false; {6692#false} is VALID [2022-02-20 18:28:44,173 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:28:44,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:44,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195548237] [2022-02-20 18:28:44,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195548237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:44,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:44,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:44,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140223706] [2022-02-20 18:28:44,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:44,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:28:44,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:44,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:28:44,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:44,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:44,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:44,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:44,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:44,229 INFO L87 Difference]: Start difference. First operand 641 states and 996 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:28:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:44,524 INFO L93 Difference]: Finished difference Result 1733 states and 2734 transitions. [2022-02-20 18:28:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:44,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:28:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:28:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:28:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:44,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:44,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:44,867 INFO L225 Difference]: With dead ends: 1733 [2022-02-20 18:28:44,867 INFO L226 Difference]: Without dead ends: 1139 [2022-02-20 18:28:44,868 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:28:44,868 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 124 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 440 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:28:44,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 440 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-02-20 18:28:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1137. [2022-02-20 18:28:44,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:44,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1139 states. Second operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have 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:28:44,892 INFO L74 IsIncluded]: Start isIncluded. First operand 1139 states. Second operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have 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:28:44,894 INFO L87 Difference]: Start difference. First operand 1139 states. Second operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have 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:28:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:44,932 INFO L93 Difference]: Finished difference Result 1139 states and 1777 transitions. [2022-02-20 18:28:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1777 transitions. [2022-02-20 18:28:44,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:44,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:44,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 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 1139 states. [2022-02-20 18:28:44,936 INFO L87 Difference]: Start difference. First operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 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 1139 states. [2022-02-20 18:28:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:44,974 INFO L93 Difference]: Finished difference Result 1139 states and 1777 transitions. [2022-02-20 18:28:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1777 transitions. [2022-02-20 18:28:44,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:44,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:44,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:44,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have 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:28:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1776 transitions. [2022-02-20 18:28:45,018 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1776 transitions. Word has length 80 [2022-02-20 18:28:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:45,018 INFO L470 AbstractCegarLoop]: Abstraction has 1137 states and 1776 transitions. [2022-02-20 18:28:45,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:28:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1776 transitions. [2022-02-20 18:28:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:28:45,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:45,020 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, 1, 1, 1] [2022-02-20 18:28:45,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:28:45,020 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:45,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1219881940, now seen corresponding path program 1 times [2022-02-20 18:28:45,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:45,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862836302] [2022-02-20 18:28:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:45,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:45,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {12166#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(48, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~0 := 0; {12166#true} is VALID [2022-02-20 18:28:45,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {12166#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12166#true} is VALID [2022-02-20 18:28:45,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {12166#true} assume 0 == ~r1~0; {12166#true} is VALID [2022-02-20 18:28:45,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {12166#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {12166#true} is VALID [2022-02-20 18:28:45,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {12166#true} assume ~id1~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:45,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {12166#true} assume 0 == ~st1~0; {12166#true} is VALID [2022-02-20 18:28:45,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {12166#true} assume ~send1~0 == ~id1~0; {12166#true} is VALID [2022-02-20 18:28:45,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {12166#true} assume 0 == ~mode1~0 % 256; {12166#true} is VALID [2022-02-20 18:28:45,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {12166#true} assume ~id2~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:45,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {12166#true} assume 0 == ~st2~0; {12166#true} is VALID [2022-02-20 18:28:45,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {12166#true} assume ~send2~0 == ~id2~0; {12166#true} is VALID [2022-02-20 18:28:45,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {12166#true} assume 0 == ~mode2~0 % 256; {12166#true} is VALID [2022-02-20 18:28:45,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {12166#true} assume ~id3~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:45,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {12166#true} assume 0 == ~st3~0; {12166#true} is VALID [2022-02-20 18:28:45,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {12166#true} assume ~send3~0 == ~id3~0; {12166#true} is VALID [2022-02-20 18:28:45,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {12166#true} assume 0 == ~mode3~0 % 256; {12166#true} is VALID [2022-02-20 18:28:45,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {12166#true} assume ~id4~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:45,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {12166#true} assume 0 == ~st4~0; {12166#true} is VALID [2022-02-20 18:28:45,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {12166#true} assume ~send4~0 == ~id4~0; {12166#true} is VALID [2022-02-20 18:28:45,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {12166#true} assume 0 == ~mode4~0 % 256; {12166#true} is VALID [2022-02-20 18:28:45,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {12166#true} assume ~id5~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:45,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {12166#true} assume 0 == ~st5~0; {12166#true} is VALID [2022-02-20 18:28:45,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {12166#true} assume ~send5~0 == ~id5~0; {12166#true} is VALID [2022-02-20 18:28:45,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {12166#true} assume 0 == ~mode5~0 % 256; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {12168#(= (+ (* (- 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; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive1~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~id1~0); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive2~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive3~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive4~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:45,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {12168#(= (+ (* (- 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; {12167#false} is VALID [2022-02-20 18:28:45,105 INFO L290 TraceCheckUtils]: 69: Hoare triple {12167#false} assume !(node5_~m5~0#1 != ~nomsg~0); {12167#false} is VALID [2022-02-20 18:28:45,105 INFO L290 TraceCheckUtils]: 70: Hoare triple {12167#false} ~mode5~0 := 0; {12167#false} is VALID [2022-02-20 18:28:45,105 INFO L290 TraceCheckUtils]: 71: Hoare triple {12167#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {12167#false} is VALID [2022-02-20 18:28:45,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {12167#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12167#false} is VALID [2022-02-20 18:28:45,106 INFO L290 TraceCheckUtils]: 73: Hoare triple {12167#false} assume !(node6_~m6~0#1 != ~nomsg~0); {12167#false} is VALID [2022-02-20 18:28:45,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {12167#false} ~mode6~0 := 0; {12167#false} is VALID [2022-02-20 18:28:45,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {12167#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; {12167#false} is VALID [2022-02-20 18:28:45,106 INFO L290 TraceCheckUtils]: 76: Hoare triple {12167#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {12167#false} is VALID [2022-02-20 18:28:45,106 INFO L290 TraceCheckUtils]: 77: Hoare triple {12167#false} check_#res#1 := check_~tmp~1#1; {12167#false} is VALID [2022-02-20 18:28:45,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {12167#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {12167#false} is VALID [2022-02-20 18:28:45,106 INFO L290 TraceCheckUtils]: 79: Hoare triple {12167#false} assume 0 == assert_~arg#1 % 256; {12167#false} is VALID [2022-02-20 18:28:45,106 INFO L290 TraceCheckUtils]: 80: Hoare triple {12167#false} assume !false; {12167#false} is VALID [2022-02-20 18:28:45,108 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:28:45,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:45,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862836302] [2022-02-20 18:28:45,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862836302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:45,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:45,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:45,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332859488] [2022-02-20 18:28:45,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:28:45,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:45,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:28:45,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:45,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:45,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:45,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:45,161 INFO L87 Difference]: Start difference. First operand 1137 states and 1776 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:28:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:45,711 INFO L93 Difference]: Finished difference Result 3125 states and 4914 transitions. [2022-02-20 18:28:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:28:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:28:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:28:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:45,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:45,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:46,143 INFO L225 Difference]: With dead ends: 3125 [2022-02-20 18:28:46,143 INFO L226 Difference]: Without dead ends: 2035 [2022-02-20 18:28:46,144 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:28:46,145 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 119 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 431 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:28:46,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 431 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2022-02-20 18:28:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2033. [2022-02-20 18:28:46,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:46,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2035 states. Second operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have 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:28:46,187 INFO L74 IsIncluded]: Start isIncluded. First operand 2035 states. Second operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have 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:28:46,189 INFO L87 Difference]: Start difference. First operand 2035 states. Second operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have 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:28:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,303 INFO L93 Difference]: Finished difference Result 2035 states and 3169 transitions. [2022-02-20 18:28:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3169 transitions. [2022-02-20 18:28:46,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:46,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:46,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 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 2035 states. [2022-02-20 18:28:46,311 INFO L87 Difference]: Start difference. First operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 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 2035 states. [2022-02-20 18:28:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,434 INFO L93 Difference]: Finished difference Result 2035 states and 3169 transitions. [2022-02-20 18:28:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3169 transitions. [2022-02-20 18:28:46,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:46,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:46,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:46,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have 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:28:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 3168 transitions. [2022-02-20 18:28:46,578 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 3168 transitions. Word has length 81 [2022-02-20 18:28:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:46,578 INFO L470 AbstractCegarLoop]: Abstraction has 2033 states and 3168 transitions. [2022-02-20 18:28:46,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:28:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 3168 transitions. [2022-02-20 18:28:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:28:46,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:46,579 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, 1, 1, 1, 1] [2022-02-20 18:28:46,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:28:46,580 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1035004540, now seen corresponding path program 1 times [2022-02-20 18:28:46,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:46,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386060] [2022-02-20 18:28:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:46,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:46,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {22041#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(48, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~0 := 0; {22041#true} is VALID [2022-02-20 18:28:46,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {22041#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22041#true} is VALID [2022-02-20 18:28:46,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {22041#true} assume 0 == ~r1~0; {22041#true} is VALID [2022-02-20 18:28:46,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {22041#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {22041#true} is VALID [2022-02-20 18:28:46,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {22041#true} assume ~id1~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:46,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {22041#true} assume 0 == ~st1~0; {22041#true} is VALID [2022-02-20 18:28:46,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {22041#true} assume ~send1~0 == ~id1~0; {22041#true} is VALID [2022-02-20 18:28:46,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {22041#true} assume 0 == ~mode1~0 % 256; {22041#true} is VALID [2022-02-20 18:28:46,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {22041#true} assume ~id2~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:46,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {22041#true} assume 0 == ~st2~0; {22041#true} is VALID [2022-02-20 18:28:46,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {22041#true} assume ~send2~0 == ~id2~0; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {22041#true} assume 0 == ~mode2~0 % 256; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {22041#true} assume ~id3~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {22041#true} assume 0 == ~st3~0; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {22041#true} assume ~send3~0 == ~id3~0; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {22041#true} assume 0 == ~mode3~0 % 256; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {22041#true} assume ~id4~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {22041#true} assume 0 == ~st4~0; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {22041#true} assume ~send4~0 == ~id4~0; {22041#true} is VALID [2022-02-20 18:28:46,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {22041#true} assume 0 == ~mode4~0 % 256; {22041#true} is VALID [2022-02-20 18:28:46,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {22041#true} assume ~id5~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:46,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {22041#true} assume 0 == ~st5~0; {22041#true} is VALID [2022-02-20 18:28:46,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {22041#true} assume ~send5~0 == ~id5~0; {22041#true} is VALID [2022-02-20 18:28:46,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {22041#true} assume 0 == ~mode5~0 % 256; {22041#true} is VALID [2022-02-20 18:28:46,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {22041#true} assume ~id6~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:46,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {22041#true} assume 0 == ~st6~0; {22041#true} is VALID [2022-02-20 18:28:46,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {22041#true} assume ~send6~0 == ~id6~0; {22041#true} is VALID [2022-02-20 18:28:46,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {22041#true} assume 0 == ~mode6~0 % 256; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {22043#(= (+ (* (- 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; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive1~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~id1~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode1~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive2~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~id2~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode2~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive3~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~id3~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode3~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive4~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~id4~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode4~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive5~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~id5~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,672 INFO L290 TraceCheckUtils]: 71: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode5~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:46,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {22043#(= (+ (* (- 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; {22042#false} is VALID [2022-02-20 18:28:46,673 INFO L290 TraceCheckUtils]: 74: Hoare triple {22042#false} assume !(node6_~m6~0#1 != ~nomsg~0); {22042#false} is VALID [2022-02-20 18:28:46,673 INFO L290 TraceCheckUtils]: 75: Hoare triple {22042#false} ~mode6~0 := 0; {22042#false} is VALID [2022-02-20 18:28:46,673 INFO L290 TraceCheckUtils]: 76: Hoare triple {22042#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; {22042#false} is VALID [2022-02-20 18:28:46,673 INFO L290 TraceCheckUtils]: 77: Hoare triple {22042#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {22042#false} is VALID [2022-02-20 18:28:46,674 INFO L290 TraceCheckUtils]: 78: Hoare triple {22042#false} check_#res#1 := check_~tmp~1#1; {22042#false} is VALID [2022-02-20 18:28:46,674 INFO L290 TraceCheckUtils]: 79: Hoare triple {22042#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {22042#false} is VALID [2022-02-20 18:28:46,674 INFO L290 TraceCheckUtils]: 80: Hoare triple {22042#false} assume 0 == assert_~arg#1 % 256; {22042#false} is VALID [2022-02-20 18:28:46,674 INFO L290 TraceCheckUtils]: 81: Hoare triple {22042#false} assume !false; {22042#false} is VALID [2022-02-20 18:28:46,675 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:28:46,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:46,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386060] [2022-02-20 18:28:46,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:46,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:46,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:46,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082757951] [2022-02-20 18:28:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:46,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:28:46,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:46,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:28:46,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:46,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:46,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:46,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:46,725 INFO L87 Difference]: Start difference. First operand 2033 states and 3168 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:28:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:47,870 INFO L93 Difference]: Finished difference Result 5621 states and 8770 transitions. [2022-02-20 18:28:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:47,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:28:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:28:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:28:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:47,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:48,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:48,585 INFO L225 Difference]: With dead ends: 5621 [2022-02-20 18:28:48,585 INFO L226 Difference]: Without dead ends: 3635 [2022-02-20 18:28:48,587 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:28:48,590 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 114 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 422 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:28:48,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 422 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2022-02-20 18:28:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3633. [2022-02-20 18:28:48,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:48,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3635 states. Second operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have 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:28:48,683 INFO L74 IsIncluded]: Start isIncluded. First operand 3635 states. Second operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have 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:28:48,686 INFO L87 Difference]: Start difference. First operand 3635 states. Second operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have 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:28:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,060 INFO L93 Difference]: Finished difference Result 3635 states and 5617 transitions. [2022-02-20 18:28:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5617 transitions. [2022-02-20 18:28:49,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:49,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:49,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 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 3635 states. [2022-02-20 18:28:49,072 INFO L87 Difference]: Start difference. First operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 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 3635 states. [2022-02-20 18:28:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,432 INFO L93 Difference]: Finished difference Result 3635 states and 5617 transitions. [2022-02-20 18:28:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5617 transitions. [2022-02-20 18:28:49,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:49,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:49,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:49,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have 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:28:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 5616 transitions. [2022-02-20 18:28:49,850 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 5616 transitions. Word has length 82 [2022-02-20 18:28:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:49,850 INFO L470 AbstractCegarLoop]: Abstraction has 3633 states and 5616 transitions. [2022-02-20 18:28:49,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:28:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 5616 transitions. [2022-02-20 18:28:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 18:28:49,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:49,851 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, 1, 1, 1, 1, 1] [2022-02-20 18:28:49,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:28:49,851 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:49,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1846622820, now seen corresponding path program 1 times [2022-02-20 18:28:49,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:49,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155856664] [2022-02-20 18:28:49,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:49,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {39852#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(48, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~0 := 0; {39852#true} is VALID [2022-02-20 18:28:49,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {39852#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {39852#true} is VALID [2022-02-20 18:28:49,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {39852#true} assume 0 == ~r1~0; {39852#true} is VALID [2022-02-20 18:28:49,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {39852#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {39852#true} is VALID [2022-02-20 18:28:49,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {39852#true} assume ~id1~0 >= 0; {39852#true} is VALID [2022-02-20 18:28:49,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {39852#true} assume 0 == ~st1~0; {39854#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:49,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {39854#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {39854#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:49,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {39854#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {39854#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:49,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {39854#(<= ~st1~0 0)} assume ~id2~0 >= 0; {39854#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:49,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {39854#(<= ~st1~0 0)} assume 0 == ~st2~0; {39855#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {39855#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {39855#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {39855#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {39855#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {39855#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {39855#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {39855#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:49,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {39859#(<= (+ ~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; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive1~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send1~0 != ~id1~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {39859#(<= (+ ~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~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive2~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~id2~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {39859#(<= (+ ~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~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive3~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~id3~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {39859#(<= (+ ~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~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive4~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~id4~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {39859#(<= (+ ~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~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive5~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~id5~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {39859#(<= (+ ~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~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive6~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~id6~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 77: Hoare triple {39859#(<= (+ ~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; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:49,942 INFO L290 TraceCheckUtils]: 78: Hoare triple {39859#(<= (+ ~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; {39853#false} is VALID [2022-02-20 18:28:49,942 INFO L290 TraceCheckUtils]: 79: Hoare triple {39853#false} check_#res#1 := check_~tmp~1#1; {39853#false} is VALID [2022-02-20 18:28:49,942 INFO L290 TraceCheckUtils]: 80: Hoare triple {39853#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {39853#false} is VALID [2022-02-20 18:28:49,942 INFO L290 TraceCheckUtils]: 81: Hoare triple {39853#false} assume 0 == assert_~arg#1 % 256; {39853#false} is VALID [2022-02-20 18:28:49,942 INFO L290 TraceCheckUtils]: 82: Hoare triple {39853#false} assume !false; {39853#false} is VALID [2022-02-20 18:28:49,942 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:28:49,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:49,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155856664] [2022-02-20 18:28:49,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155856664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:49,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:49,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:28:49,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410319922] [2022-02-20 18:28:49,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:28:49,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:49,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:28:49,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:49,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:28:49,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:28:49,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:28:49,993 INFO L87 Difference]: Start difference. First operand 3633 states and 5616 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:29:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:24,447 INFO L93 Difference]: Finished difference Result 28735 states and 44599 transitions. [2022-02-20 18:29:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:29:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:29:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:29:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1255 transitions. [2022-02-20 18:29:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:29:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1255 transitions. [2022-02-20 18:29:24,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1255 transitions. [2022-02-20 18:29:25,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1255 edges. 1255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:45,981 INFO L225 Difference]: With dead ends: 28735 [2022-02-20 18:29:45,982 INFO L226 Difference]: Without dead ends: 25149 [2022-02-20 18:29:45,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:29:45,988 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 1893 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1893 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:45,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1893 Valid, 2912 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:29:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25149 states. [2022-02-20 18:29:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25149 to 7217. [2022-02-20 18:29:48,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:48,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25149 states. Second operand has 7217 states, 7216 states have (on average 1.5321507760532151) internal successors, (11056), 7216 states have internal predecessors, (11056), 0 states have call successors, (0), 0 states have 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:29:48,514 INFO L74 IsIncluded]: Start isIncluded. First operand 25149 states. Second operand has 7217 states, 7216 states have (on average 1.5321507760532151) internal successors, (11056), 7216 states have internal predecessors, (11056), 0 states have call successors, (0), 0 states have 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:29:48,520 INFO L87 Difference]: Start difference. First operand 25149 states. Second operand has 7217 states, 7216 states have (on average 1.5321507760532151) internal successors, (11056), 7216 states have internal predecessors, (11056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)