./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:27:20,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:27:20,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:27:20,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:27:20,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:27:20,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:27:20,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:27:20,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:27:20,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:27:20,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:27:20,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:27:20,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:27:20,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:27:20,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:27:20,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:27:20,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:27:20,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:27:20,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:27:20,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:27:20,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:27:20,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:27:20,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:27:20,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:27:20,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:27:20,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:27:20,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:27:20,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:27:20,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:27:20,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:27:20,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:27:20,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:27:20,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:27:20,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:27:20,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:27:20,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:27:20,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:27:20,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:27:20,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:27:20,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:27:20,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:27:20,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:27:20,888 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:27:20,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:27:20,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:27:20,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:27:20,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:27:20,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:27:20,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:27:20,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:27:20,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:27:20,923 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:27:20,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:27:20,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:27:20,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:27:20,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:27:20,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:27:20,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:27:20,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:27:20,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:27:20,925 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:27:20,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:27:20,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:27:20,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:27:20,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:27:20,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:27:20,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:27:20,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:20,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:27:20,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:27:20,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:27:20,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:27:20,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:27:20,930 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:27:20,930 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:27:20,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:27:20,930 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 -> 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 [2022-02-20 18:27:21,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:27:21,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:27:21,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:27:21,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:27:21,213 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:27:21,214 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.4.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:27:21,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240a49e84/875e8ba71de343a98449d11cb7153c3c/FLAG0385b8914 [2022-02-20 18:27:21,716 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:27:21,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:27:21,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240a49e84/875e8ba71de343a98449d11cb7153c3c/FLAG0385b8914 [2022-02-20 18:27:22,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240a49e84/875e8ba71de343a98449d11cb7153c3c [2022-02-20 18:27:22,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:27:22,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:27:22,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:22,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:27:22,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:27:22,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6416724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22, skipping insertion in model container [2022-02-20 18:27:22,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:27:22,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:27:22,376 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.4.1.ufo.UNBOUNDED.pals.c[9529,9542] [2022-02-20 18:27:22,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:22,387 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:27:22,431 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.4.1.ufo.UNBOUNDED.pals.c[9529,9542] [2022-02-20 18:27:22,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:22,444 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:27:22,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22 WrapperNode [2022-02-20 18:27:22,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:22,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:22,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:27:22,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:27:22,453 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:27:22" (1/1) ... [2022-02-20 18:27:22,461 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:27:22" (1/1) ... [2022-02-20 18:27:22,501 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 320 [2022-02-20 18:27:22,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:22,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:27:22,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:27:22,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:27:22,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:27:22,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:27:22,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:27:22,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:27:22,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (1/1) ... [2022-02-20 18:27:22,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:22,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:27:22,562 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:27:22,568 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:27:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:27:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:27:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:27:22,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:27:22,661 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:27:22,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:27:23,263 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:27:23,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:27:23,277 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:27:23,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:23 BoogieIcfgContainer [2022-02-20 18:27:23,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:27:23,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:27:23,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:27:23,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:27:23,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:27:22" (1/3) ... [2022-02-20 18:27:23,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316ec698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:23, skipping insertion in model container [2022-02-20 18:27:23,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:22" (2/3) ... [2022-02-20 18:27:23,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316ec698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:23, skipping insertion in model container [2022-02-20 18:27:23,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:23" (3/3) ... [2022-02-20 18:27:23,287 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:27:23,291 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:27:23,292 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:27:23,331 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:27:23,336 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:27:23,336 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:27:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 100 states have (on average 1.69) internal successors, (169), 101 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have 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:27:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:27:23,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:23,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:23,381 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash 773042370, now seen corresponding path program 1 times [2022-02-20 18:27:23,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:23,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282186636] [2022-02-20 18:27:23,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:23,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#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(49, 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; {105#true} is VALID [2022-02-20 18:27:23,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {105#true} is VALID [2022-02-20 18:27:23,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {105#true} is VALID [2022-02-20 18:27:23,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} init_#res#1 := init_~tmp~0#1; {105#true} is VALID [2022-02-20 18:27:23,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {105#true} is VALID [2022-02-20 18:27:23,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {106#false} is VALID [2022-02-20 18:27:23,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {106#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;main_~i2~0#1 := 0; {106#false} is VALID [2022-02-20 18:27:23,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {106#false} assume !false;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; {106#false} is VALID [2022-02-20 18:27:23,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {106#false} assume !(0 != ~mode1~0 % 256); {106#false} is VALID [2022-02-20 18:27:23,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {106#false} assume !(0 != ~alive1~0 % 256); {106#false} is VALID [2022-02-20 18:27:23,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {106#false} assume !(~send1~0 != ~id1~0); {106#false} is VALID [2022-02-20 18:27:23,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {106#false} ~mode1~0 := 1; {106#false} is VALID [2022-02-20 18:27:23,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {106#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; {106#false} is VALID [2022-02-20 18:27:23,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {106#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {106#false} is VALID [2022-02-20 18:27:23,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {106#false} assume !(node2_~m2~0#1 != ~nomsg~0); {106#false} is VALID [2022-02-20 18:27:23,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {106#false} ~mode2~0 := 0; {106#false} is VALID [2022-02-20 18:27:23,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {106#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; {106#false} is VALID [2022-02-20 18:27:23,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {106#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {106#false} is VALID [2022-02-20 18:27:23,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {106#false} assume !(node3_~m3~0#1 != ~nomsg~0); {106#false} is VALID [2022-02-20 18:27:23,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {106#false} ~mode3~0 := 0; {106#false} is VALID [2022-02-20 18:27:23,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {106#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; {106#false} is VALID [2022-02-20 18:27:23,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {106#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {106#false} is VALID [2022-02-20 18:27:23,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {106#false} assume !(node4_~m4~0#1 != ~nomsg~0); {106#false} is VALID [2022-02-20 18:27:23,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {106#false} ~mode4~0 := 0; {106#false} is VALID [2022-02-20 18:27:23,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {106#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {106#false} is VALID [2022-02-20 18:27:23,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {106#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {106#false} is VALID [2022-02-20 18:27:23,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {106#false} check_#res#1 := check_~tmp~1#1; {106#false} is VALID [2022-02-20 18:27:23,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {106#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {106#false} is VALID [2022-02-20 18:27:23,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {106#false} assume 0 == assert_~arg#1 % 256; {106#false} is VALID [2022-02-20 18:27:23,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {106#false} assume !false; {106#false} is VALID [2022-02-20 18:27:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:23,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:23,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282186636] [2022-02-20 18:27:23,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282186636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:23,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:23,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:27:23,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672896308] [2022-02-20 18:27:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:23,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 18:27:23,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:23,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:23,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:23,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:27:23,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:27:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:23,743 INFO L87 Difference]: Start difference. First operand has 102 states, 100 states have (on average 1.69) internal successors, (169), 101 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:23,892 INFO L93 Difference]: Finished difference Result 171 states and 281 transitions. [2022-02-20 18:27:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:27:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 18:27:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 281 transitions. [2022-02-20 18:27:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 281 transitions. [2022-02-20 18:27:23,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 281 transitions. [2022-02-20 18:27:24,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:24,201 INFO L225 Difference]: With dead ends: 171 [2022-02-20 18:27:24,201 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 18:27:24,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:24,207 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:24,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 18:27:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-20 18:27:24,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:24,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 97 states have (on average 1.6701030927835052) internal successors, (162), 97 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:27:24,236 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 97 states have (on average 1.6701030927835052) internal successors, (162), 97 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:27:24,237 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 97 states have (on average 1.6701030927835052) internal successors, (162), 97 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:27:24,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:24,244 INFO L93 Difference]: Finished difference Result 98 states and 162 transitions. [2022-02-20 18:27:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2022-02-20 18:27:24,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:24,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:24,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 97 states have (on average 1.6701030927835052) internal successors, (162), 97 states have internal predecessors, (162), 0 states have call successors, (0), 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 98 states. [2022-02-20 18:27:24,247 INFO L87 Difference]: Start difference. First operand has 98 states, 97 states have (on average 1.6701030927835052) internal successors, (162), 97 states have internal predecessors, (162), 0 states have call successors, (0), 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 98 states. [2022-02-20 18:27:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:24,252 INFO L93 Difference]: Finished difference Result 98 states and 162 transitions. [2022-02-20 18:27:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2022-02-20 18:27:24,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:24,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:24,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:24,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.6701030927835052) internal successors, (162), 97 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:27:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2022-02-20 18:27:24,259 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 30 [2022-02-20 18:27:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:24,260 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2022-02-20 18:27:24,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2022-02-20 18:27:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:27:24,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:24,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:24,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:27:24,263 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:24,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash 913590980, now seen corresponding path program 1 times [2022-02-20 18:27:24,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:24,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931912847] [2022-02-20 18:27:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:24,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#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(49, 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; {595#true} is VALID [2022-02-20 18:27:24,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {595#true} is VALID [2022-02-20 18:27:24,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {597#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:27:24,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {598#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:27:24,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {598#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {599#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:27:24,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {599#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {596#false} is VALID [2022-02-20 18:27:24,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {596#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;main_~i2~0#1 := 0; {596#false} is VALID [2022-02-20 18:27:24,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#false} assume !false;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; {596#false} is VALID [2022-02-20 18:27:24,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#false} assume !(0 != ~mode1~0 % 256); {596#false} is VALID [2022-02-20 18:27:24,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#false} assume !(0 != ~alive1~0 % 256); {596#false} is VALID [2022-02-20 18:27:24,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {596#false} assume !(~send1~0 != ~id1~0); {596#false} is VALID [2022-02-20 18:27:24,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#false} ~mode1~0 := 1; {596#false} is VALID [2022-02-20 18:27:24,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#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; {596#false} is VALID [2022-02-20 18:27:24,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {596#false} is VALID [2022-02-20 18:27:24,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !(node2_~m2~0#1 != ~nomsg~0); {596#false} is VALID [2022-02-20 18:27:24,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#false} ~mode2~0 := 0; {596#false} is VALID [2022-02-20 18:27:24,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#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; {596#false} is VALID [2022-02-20 18:27:24,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {596#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {596#false} is VALID [2022-02-20 18:27:24,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {596#false} assume !(node3_~m3~0#1 != ~nomsg~0); {596#false} is VALID [2022-02-20 18:27:24,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#false} ~mode3~0 := 0; {596#false} is VALID [2022-02-20 18:27:24,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#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; {596#false} is VALID [2022-02-20 18:27:24,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {596#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {596#false} is VALID [2022-02-20 18:27:24,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {596#false} assume !(node4_~m4~0#1 != ~nomsg~0); {596#false} is VALID [2022-02-20 18:27:24,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {596#false} ~mode4~0 := 0; {596#false} is VALID [2022-02-20 18:27:24,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {596#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {596#false} is VALID [2022-02-20 18:27:24,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {596#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {596#false} is VALID [2022-02-20 18:27:24,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {596#false} check_#res#1 := check_~tmp~1#1; {596#false} is VALID [2022-02-20 18:27:24,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {596#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {596#false} is VALID [2022-02-20 18:27:24,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {596#false} assume 0 == assert_~arg#1 % 256; {596#false} is VALID [2022-02-20 18:27:24,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-02-20 18:27:24,361 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:27:24,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:24,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931912847] [2022-02-20 18:27:24,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931912847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:24,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:24,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:24,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898611923] [2022-02-20 18:27:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:24,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 18:27:24,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:24,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:24,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:24,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:24,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:24,394 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:24,791 INFO L93 Difference]: Finished difference Result 170 states and 274 transitions. [2022-02-20 18:27:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:24,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 18:27:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2022-02-20 18:27:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2022-02-20 18:27:24,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 274 transitions. [2022-02-20 18:27:25,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:25,010 INFO L225 Difference]: With dead ends: 170 [2022-02-20 18:27:25,010 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 18:27:25,010 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:27:25,012 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 3 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:25,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 613 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 18:27:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-20 18:27:25,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:25,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:27:25,019 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:27:25,019 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:27:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:25,022 INFO L93 Difference]: Finished difference Result 98 states and 138 transitions. [2022-02-20 18:27:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2022-02-20 18:27:25,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:25,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:25,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 0 states have call successors, (0), 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 98 states. [2022-02-20 18:27:25,024 INFO L87 Difference]: Start difference. First operand has 98 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 0 states have call successors, (0), 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 98 states. [2022-02-20 18:27:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:25,027 INFO L93 Difference]: Finished difference Result 98 states and 138 transitions. [2022-02-20 18:27:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2022-02-20 18:27:25,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:25,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:25,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:25,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:27:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 138 transitions. [2022-02-20 18:27:25,032 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 138 transitions. Word has length 30 [2022-02-20 18:27:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:25,033 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 138 transitions. [2022-02-20 18:27:25,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2022-02-20 18:27:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:27:25,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:25,034 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] [2022-02-20 18:27:25,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:27:25,035 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1508952555, now seen corresponding path program 1 times [2022-02-20 18:27:25,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:25,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454252937] [2022-02-20 18:27:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:25,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {1091#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(49, 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; {1091#true} is VALID [2022-02-20 18:27:25,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1091#true} is VALID [2022-02-20 18:27:25,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {1091#true} assume 0 == ~r1~0 % 256; {1091#true} is VALID [2022-02-20 18:27:25,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {1091#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1091#true} is VALID [2022-02-20 18:27:25,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {1091#true} assume ~id1~0 >= 0; {1091#true} is VALID [2022-02-20 18:27:25,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {1091#true} assume 0 == ~st1~0; {1091#true} is VALID [2022-02-20 18:27:25,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {1091#true} assume ~send1~0 == ~id1~0; {1091#true} is VALID [2022-02-20 18:27:25,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {1091#true} assume 0 == ~mode1~0 % 256; {1091#true} is VALID [2022-02-20 18:27:25,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {1091#true} assume ~id2~0 >= 0; {1091#true} is VALID [2022-02-20 18:27:25,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {1091#true} assume 0 == ~st2~0; {1091#true} is VALID [2022-02-20 18:27:25,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {1091#true} assume ~send2~0 == ~id2~0; {1091#true} is VALID [2022-02-20 18:27:25,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {1091#true} assume 0 == ~mode2~0 % 256; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {1093#(= (+ (* (- 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;main_~i2~0#1 := 0; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;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; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {1093#(= (+ (* (- 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; {1093#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:25,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {1093#(= (+ (* (- 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; {1092#false} is VALID [2022-02-20 18:27:25,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {1092#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1092#false} is VALID [2022-02-20 18:27:25,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {1092#false} ~mode2~0 := 0; {1092#false} is VALID [2022-02-20 18:27:25,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {1092#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; {1092#false} is VALID [2022-02-20 18:27:25,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {1092#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1092#false} is VALID [2022-02-20 18:27:25,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {1092#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1092#false} is VALID [2022-02-20 18:27:25,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {1092#false} ~mode3~0 := 0; {1092#false} is VALID [2022-02-20 18:27:25,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {1092#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; {1092#false} is VALID [2022-02-20 18:27:25,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {1092#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1092#false} is VALID [2022-02-20 18:27:25,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {1092#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1092#false} is VALID [2022-02-20 18:27:25,184 INFO L290 TraceCheckUtils]: 46: Hoare triple {1092#false} ~mode4~0 := 0; {1092#false} is VALID [2022-02-20 18:27:25,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {1092#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1092#false} is VALID [2022-02-20 18:27:25,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {1092#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1092#false} is VALID [2022-02-20 18:27:25,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {1092#false} check_#res#1 := check_~tmp~1#1; {1092#false} is VALID [2022-02-20 18:27:25,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {1092#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {1092#false} is VALID [2022-02-20 18:27:25,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {1092#false} assume 0 == assert_~arg#1 % 256; {1092#false} is VALID [2022-02-20 18:27:25,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-02-20 18:27:25,188 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:27:25,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:25,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454252937] [2022-02-20 18:27:25,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454252937] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:25,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:25,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:25,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261073511] [2022-02-20 18:27:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:25,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:27:25,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:25,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:27:25,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:25,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:25,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:25,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:25,235 INFO L87 Difference]: Start difference. First operand 98 states and 138 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:27:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:25,455 INFO L93 Difference]: Finished difference Result 222 states and 334 transitions. [2022-02-20 18:27:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:27:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:27:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 18:27:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:27:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 18:27:25,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 334 transitions. [2022-02-20 18:27:25,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:25,737 INFO L225 Difference]: With dead ends: 222 [2022-02-20 18:27:25,738 INFO L226 Difference]: Without dead ends: 154 [2022-02-20 18:27:25,738 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:27:25,739 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 91 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 299 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:27:25,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 299 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-02-20 18:27:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-02-20 18:27:25,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:25,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 152 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have 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:27:25,755 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 152 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have 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:27:25,756 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 152 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have 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:27:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:25,763 INFO L93 Difference]: Finished difference Result 154 states and 225 transitions. [2022-02-20 18:27:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 225 transitions. [2022-02-20 18:27:25,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:25,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:25,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 0 states have call successors, (0), 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 154 states. [2022-02-20 18:27:25,765 INFO L87 Difference]: Start difference. First operand has 152 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 0 states have call successors, (0), 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 154 states. [2022-02-20 18:27:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:25,771 INFO L93 Difference]: Finished difference Result 154 states and 225 transitions. [2022-02-20 18:27:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 225 transitions. [2022-02-20 18:27:25,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:25,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:25,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:25,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have 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:27:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2022-02-20 18:27:25,778 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 53 [2022-02-20 18:27:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:25,780 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2022-02-20 18:27:25,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:27:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2022-02-20 18:27:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:27:25,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:25,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:25,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:27:25,784 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:25,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:25,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1759991574, now seen corresponding path program 1 times [2022-02-20 18:27:25,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:25,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906488134] [2022-02-20 18:27:25,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:25,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:25,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {1810#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(49, 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; {1810#true} is VALID [2022-02-20 18:27:25,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {1810#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1810#true} is VALID [2022-02-20 18:27:25,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {1810#true} assume 0 == ~r1~0 % 256; {1810#true} is VALID [2022-02-20 18:27:25,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {1810#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1810#true} is VALID [2022-02-20 18:27:25,899 INFO L290 TraceCheckUtils]: 4: Hoare triple {1810#true} assume ~id1~0 >= 0; {1810#true} is VALID [2022-02-20 18:27:25,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {1810#true} assume 0 == ~st1~0; {1810#true} is VALID [2022-02-20 18:27:25,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {1810#true} assume ~send1~0 == ~id1~0; {1810#true} is VALID [2022-02-20 18:27:25,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {1810#true} assume 0 == ~mode1~0 % 256; {1810#true} is VALID [2022-02-20 18:27:25,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1810#true} assume ~id2~0 >= 0; {1810#true} is VALID [2022-02-20 18:27:25,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {1810#true} assume 0 == ~st2~0; {1810#true} is VALID [2022-02-20 18:27:25,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {1810#true} assume ~send2~0 == ~id2~0; {1810#true} is VALID [2022-02-20 18:27:25,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#true} assume 0 == ~mode2~0 % 256; {1810#true} is VALID [2022-02-20 18:27:25,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#true} assume ~id3~0 >= 0; {1810#true} is VALID [2022-02-20 18:27:25,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#true} assume 0 == ~st3~0; {1810#true} is VALID [2022-02-20 18:27:25,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {1810#true} assume ~send3~0 == ~id3~0; {1810#true} is VALID [2022-02-20 18:27:25,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {1810#true} assume 0 == ~mode3~0 % 256; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {1812#(= (+ (* (- 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;main_~i2~0#1 := 0; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;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; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {1812#(= (+ (* (- 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; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {1812#(= (+ (* (- 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; {1812#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:25,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {1812#(= (+ (* (- 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; {1811#false} is VALID [2022-02-20 18:27:25,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {1811#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1811#false} is VALID [2022-02-20 18:27:25,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {1811#false} ~mode3~0 := 0; {1811#false} is VALID [2022-02-20 18:27:25,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {1811#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; {1811#false} is VALID [2022-02-20 18:27:25,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {1811#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1811#false} is VALID [2022-02-20 18:27:25,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {1811#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1811#false} is VALID [2022-02-20 18:27:25,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {1811#false} ~mode4~0 := 0; {1811#false} is VALID [2022-02-20 18:27:25,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {1811#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1811#false} is VALID [2022-02-20 18:27:25,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {1811#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1811#false} is VALID [2022-02-20 18:27:25,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {1811#false} check_#res#1 := check_~tmp~1#1; {1811#false} is VALID [2022-02-20 18:27:25,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {1811#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {1811#false} is VALID [2022-02-20 18:27:25,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {1811#false} assume 0 == assert_~arg#1 % 256; {1811#false} is VALID [2022-02-20 18:27:25,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {1811#false} assume !false; {1811#false} is VALID [2022-02-20 18:27:25,937 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:27:25,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:25,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906488134] [2022-02-20 18:27:25,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906488134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:25,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:25,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:25,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760712191] [2022-02-20 18:27:25,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:25,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:27:25,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:25,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:25,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:25,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:25,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:25,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:25,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:25,980 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:26,187 INFO L93 Difference]: Finished difference Result 372 states and 572 transitions. [2022-02-20 18:27:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:27:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 18:27:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 18:27:26,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 334 transitions. [2022-02-20 18:27:26,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:26,452 INFO L225 Difference]: With dead ends: 372 [2022-02-20 18:27:26,452 INFO L226 Difference]: Without dead ends: 250 [2022-02-20 18:27:26,453 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:27:26,454 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 86 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 290 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:27:26,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 290 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-02-20 18:27:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2022-02-20 18:27:26,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:26,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 248 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 247 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have 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:27:26,470 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 248 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 247 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have 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:27:26,470 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 248 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 247 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have 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:27:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:26,477 INFO L93 Difference]: Finished difference Result 250 states and 376 transitions. [2022-02-20 18:27:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2022-02-20 18:27:26,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:26,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:26,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 247 states have internal predecessors, (375), 0 states have call successors, (0), 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 250 states. [2022-02-20 18:27:26,480 INFO L87 Difference]: Start difference. First operand has 248 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 247 states have internal predecessors, (375), 0 states have call successors, (0), 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 250 states. [2022-02-20 18:27:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:26,487 INFO L93 Difference]: Finished difference Result 250 states and 376 transitions. [2022-02-20 18:27:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2022-02-20 18:27:26,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:26,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:26,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:26,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 247 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have 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:27:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 375 transitions. [2022-02-20 18:27:26,496 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 375 transitions. Word has length 54 [2022-02-20 18:27:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:26,497 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 375 transitions. [2022-02-20 18:27:26,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 375 transitions. [2022-02-20 18:27:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:27:26,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:26,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:26,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:27:26,498 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:26,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1078196827, now seen corresponding path program 1 times [2022-02-20 18:27:26,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:26,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560685916] [2022-02-20 18:27:26,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:26,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {2997#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(49, 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; {2997#true} is VALID [2022-02-20 18:27:26,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {2997#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2997#true} is VALID [2022-02-20 18:27:26,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {2997#true} assume 0 == ~r1~0 % 256; {2997#true} is VALID [2022-02-20 18:27:26,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {2997#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {2997#true} is VALID [2022-02-20 18:27:26,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {2997#true} assume ~id1~0 >= 0; {2997#true} is VALID [2022-02-20 18:27:26,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {2997#true} assume 0 == ~st1~0; {2997#true} is VALID [2022-02-20 18:27:26,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {2997#true} assume ~send1~0 == ~id1~0; {2997#true} is VALID [2022-02-20 18:27:26,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {2997#true} assume 0 == ~mode1~0 % 256; {2997#true} is VALID [2022-02-20 18:27:26,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {2997#true} assume ~id2~0 >= 0; {2997#true} is VALID [2022-02-20 18:27:26,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {2997#true} assume 0 == ~st2~0; {2997#true} is VALID [2022-02-20 18:27:26,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {2997#true} assume ~send2~0 == ~id2~0; {2997#true} is VALID [2022-02-20 18:27:26,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {2997#true} assume 0 == ~mode2~0 % 256; {2997#true} is VALID [2022-02-20 18:27:26,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {2997#true} assume ~id3~0 >= 0; {2997#true} is VALID [2022-02-20 18:27:26,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {2997#true} assume 0 == ~st3~0; {2997#true} is VALID [2022-02-20 18:27:26,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {2997#true} assume ~send3~0 == ~id3~0; {2997#true} is VALID [2022-02-20 18:27:26,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {2997#true} assume 0 == ~mode3~0 % 256; {2997#true} is VALID [2022-02-20 18:27:26,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {2997#true} assume ~id4~0 >= 0; {2997#true} is VALID [2022-02-20 18:27:26,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {2997#true} assume 0 == ~st4~0; {2997#true} is VALID [2022-02-20 18:27:26,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {2997#true} assume ~send4~0 == ~id4~0; {2997#true} is VALID [2022-02-20 18:27:26,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {2997#true} assume 0 == ~mode4~0 % 256; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {2999#(= (+ (* (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;main_~i2~0#1 := 0; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;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; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {2999#(= (+ (* (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; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {2999#(= (+ (* (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; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {2999#(= (+ (* (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; {2999#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:26,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {2999#(= (+ (* (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; {2998#false} is VALID [2022-02-20 18:27:26,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {2998#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2998#false} is VALID [2022-02-20 18:27:26,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {2998#false} ~mode4~0 := 0; {2998#false} is VALID [2022-02-20 18:27:26,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {2998#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2998#false} is VALID [2022-02-20 18:27:26,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {2998#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {2998#false} is VALID [2022-02-20 18:27:26,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {2998#false} check_#res#1 := check_~tmp~1#1; {2998#false} is VALID [2022-02-20 18:27:26,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {2998#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {2998#false} is VALID [2022-02-20 18:27:26,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {2998#false} assume 0 == assert_~arg#1 % 256; {2998#false} is VALID [2022-02-20 18:27:26,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {2998#false} assume !false; {2998#false} is VALID [2022-02-20 18:27:26,608 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:27:26,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:26,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560685916] [2022-02-20 18:27:26,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560685916] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:26,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:26,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:26,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579038866] [2022-02-20 18:27:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:26,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:27:26,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:26,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:26,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:26,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:26,650 INFO L87 Difference]: Start difference. First operand 248 states and 375 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:26,870 INFO L93 Difference]: Finished difference Result 636 states and 985 transitions. [2022-02-20 18:27:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:27:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 18:27:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 18:27:26,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 334 transitions. [2022-02-20 18:27:27,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:27,125 INFO L225 Difference]: With dead ends: 636 [2022-02-20 18:27:27,126 INFO L226 Difference]: Without dead ends: 418 [2022-02-20 18:27:27,127 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:27:27,128 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 81 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 281 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:27:27,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 281 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-02-20 18:27:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2022-02-20 18:27:27,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:27,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 418 states. Second operand has 416 states, 415 states have (on average 1.5301204819277108) internal successors, (635), 415 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have 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:27:27,148 INFO L74 IsIncluded]: Start isIncluded. First operand 418 states. Second operand has 416 states, 415 states have (on average 1.5301204819277108) internal successors, (635), 415 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have 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:27:27,149 INFO L87 Difference]: Start difference. First operand 418 states. Second operand has 416 states, 415 states have (on average 1.5301204819277108) internal successors, (635), 415 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have 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:27:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:27,161 INFO L93 Difference]: Finished difference Result 418 states and 636 transitions. [2022-02-20 18:27:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 636 transitions. [2022-02-20 18:27:27,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:27,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:27,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 416 states, 415 states have (on average 1.5301204819277108) internal successors, (635), 415 states have internal predecessors, (635), 0 states have call successors, (0), 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 418 states. [2022-02-20 18:27:27,164 INFO L87 Difference]: Start difference. First operand has 416 states, 415 states have (on average 1.5301204819277108) internal successors, (635), 415 states have internal predecessors, (635), 0 states have call successors, (0), 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 418 states. [2022-02-20 18:27:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:27,176 INFO L93 Difference]: Finished difference Result 418 states and 636 transitions. [2022-02-20 18:27:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 636 transitions. [2022-02-20 18:27:27,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:27,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:27,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:27,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.5301204819277108) internal successors, (635), 415 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have 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:27:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 635 transitions. [2022-02-20 18:27:27,191 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 635 transitions. Word has length 55 [2022-02-20 18:27:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:27,191 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 635 transitions. [2022-02-20 18:27:27,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 635 transitions. [2022-02-20 18:27:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:27:27,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:27,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:27,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:27:27,193 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1363611750, now seen corresponding path program 1 times [2022-02-20 18:27:27,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:27,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227448632] [2022-02-20 18:27:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:27,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {5012#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(49, 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; {5012#true} is VALID [2022-02-20 18:27:27,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {5012#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5012#true} is VALID [2022-02-20 18:27:27,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {5012#true} assume 0 == ~r1~0 % 256; {5012#true} is VALID [2022-02-20 18:27:27,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {5012#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {5012#true} is VALID [2022-02-20 18:27:27,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {5012#true} assume ~id1~0 >= 0; {5012#true} is VALID [2022-02-20 18:27:27,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {5012#true} assume 0 == ~st1~0; {5014#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {5014#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {5014#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {5014#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {5014#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {5014#(<= ~st1~0 0)} assume ~id2~0 >= 0; {5014#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:27,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {5014#(<= ~st1~0 0)} assume 0 == ~st2~0; {5015#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {5015#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {5015#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {5015#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {5015#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {5015#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {5015#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {5015#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {5016#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {5016#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {5016#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {5016#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {5016#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {5016#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {5016#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {5016#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;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; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive4~0 % 256); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:27,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {5017#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {5013#false} is VALID [2022-02-20 18:27:27,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {5013#false} check_#res#1 := check_~tmp~1#1; {5013#false} is VALID [2022-02-20 18:27:27,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {5013#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {5013#false} is VALID [2022-02-20 18:27:27,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {5013#false} assume 0 == assert_~arg#1 % 256; {5013#false} is VALID [2022-02-20 18:27:27,324 INFO L290 TraceCheckUtils]: 55: Hoare triple {5013#false} assume !false; {5013#false} is VALID [2022-02-20 18:27:27,324 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:27:27,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:27,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227448632] [2022-02-20 18:27:27,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227448632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:27,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:27,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:27:27,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801205205] [2022-02-20 18:27:27,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-20 18:27:27,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:27,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:27,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:27,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:27:27,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:27:27,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:27,370 INFO L87 Difference]: Start difference. First operand 416 states and 635 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:28,833 INFO L93 Difference]: Finished difference Result 2346 states and 3660 transitions. [2022-02-20 18:27:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:28,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-20 18:27:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2022-02-20 18:27:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2022-02-20 18:27:28,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 678 transitions. [2022-02-20 18:27:29,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 678 edges. 678 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:29,516 INFO L225 Difference]: With dead ends: 2346 [2022-02-20 18:27:29,516 INFO L226 Difference]: Without dead ends: 1960 [2022-02-20 18:27:29,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:27:29,518 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 780 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:29,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [780 Valid, 1152 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:27:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2022-02-20 18:27:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 800. [2022-02-20 18:27:29,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:29,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1960 states. Second operand has 800 states, 799 states have (on average 1.5306633291614518) internal successors, (1223), 799 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have 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:27:29,734 INFO L74 IsIncluded]: Start isIncluded. First operand 1960 states. Second operand has 800 states, 799 states have (on average 1.5306633291614518) internal successors, (1223), 799 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have 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:27:29,735 INFO L87 Difference]: Start difference. First operand 1960 states. Second operand has 800 states, 799 states have (on average 1.5306633291614518) internal successors, (1223), 799 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have 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:27:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:29,905 INFO L93 Difference]: Finished difference Result 1960 states and 3039 transitions. [2022-02-20 18:27:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 3039 transitions. [2022-02-20 18:27:29,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:29,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:29,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 800 states, 799 states have (on average 1.5306633291614518) internal successors, (1223), 799 states have internal predecessors, (1223), 0 states have call successors, (0), 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 1960 states. [2022-02-20 18:27:29,913 INFO L87 Difference]: Start difference. First operand has 800 states, 799 states have (on average 1.5306633291614518) internal successors, (1223), 799 states have internal predecessors, (1223), 0 states have call successors, (0), 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 1960 states. [2022-02-20 18:27:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:30,089 INFO L93 Difference]: Finished difference Result 1960 states and 3039 transitions. [2022-02-20 18:27:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 3039 transitions. [2022-02-20 18:27:30,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:30,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:30,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:30,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.5306633291614518) internal successors, (1223), 799 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have 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:27:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1223 transitions. [2022-02-20 18:27:30,131 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1223 transitions. Word has length 56 [2022-02-20 18:27:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:30,131 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 1223 transitions. [2022-02-20 18:27:30,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1223 transitions. [2022-02-20 18:27:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:27:30,132 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:30,132 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] [2022-02-20 18:27:30,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:27:30,133 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash 294385397, now seen corresponding path program 1 times [2022-02-20 18:27:30,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:30,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039445149] [2022-02-20 18:27:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:30,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {12479#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(49, 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; {12479#true} is VALID [2022-02-20 18:27:30,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {12479#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12479#true} is VALID [2022-02-20 18:27:30,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {12479#true} assume 0 == ~r1~0 % 256; {12479#true} is VALID [2022-02-20 18:27:30,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {12479#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == assume_abort_if_not_~cond#1); {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~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;main_~i2~0#1 := 0; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !false;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; {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:30,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {12481#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:30,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:30,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:30,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~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; {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:30,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:30,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {12482#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:30,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:30,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:30,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~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; {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:30,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(0 != ~mode3~0 % 256); {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:30,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {12483#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(0 != ~alive3~0 % 256); {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:30,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:30,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1; {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:30,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~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; {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:30,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(0 != ~mode4~0 % 256); {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:30,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {12484#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(0 != ~alive4~0 % 256); {12480#false} is VALID [2022-02-20 18:27:30,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {12480#false} assume !(~send4~0 != ~id4~0); {12480#false} is VALID [2022-02-20 18:27:30,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {12480#false} ~mode4~0 := 1; {12480#false} is VALID [2022-02-20 18:27:30,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {12480#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12480#false} is VALID [2022-02-20 18:27:30,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {12480#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {12480#false} is VALID [2022-02-20 18:27:30,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {12480#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {12480#false} is VALID [2022-02-20 18:27:30,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {12480#false} check_#res#1 := check_~tmp~1#1; {12480#false} is VALID [2022-02-20 18:27:30,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {12480#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {12480#false} is VALID [2022-02-20 18:27:30,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {12480#false} assume 0 == assert_~arg#1 % 256; {12480#false} is VALID [2022-02-20 18:27:30,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {12480#false} assume !false; {12480#false} is VALID [2022-02-20 18:27:30,284 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:27:30,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:30,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039445149] [2022-02-20 18:27:30,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039445149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:30,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:30,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:27:30,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388085218] [2022-02-20 18:27:30,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:30,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:27:30,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:30,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:30,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:30,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:27:30,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:27:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:30,337 INFO L87 Difference]: Start difference. First operand 800 states and 1223 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,536 INFO L93 Difference]: Finished difference Result 3568 states and 5459 transitions. [2022-02-20 18:27:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:32,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:27:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2022-02-20 18:27:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2022-02-20 18:27:32,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 508 transitions. [2022-02-20 18:27:32,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:33,236 INFO L225 Difference]: With dead ends: 3568 [2022-02-20 18:27:33,236 INFO L226 Difference]: Without dead ends: 2798 [2022-02-20 18:27:33,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:33,238 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 356 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:33,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 652 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:27:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2022-02-20 18:27:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2792. [2022-02-20 18:27:34,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:34,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2798 states. Second operand has 2792 states, 2791 states have (on average 1.5216768183446794) internal successors, (4247), 2791 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have 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:27:34,317 INFO L74 IsIncluded]: Start isIncluded. First operand 2798 states. Second operand has 2792 states, 2791 states have (on average 1.5216768183446794) internal successors, (4247), 2791 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have 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:27:34,324 INFO L87 Difference]: Start difference. First operand 2798 states. Second operand has 2792 states, 2791 states have (on average 1.5216768183446794) internal successors, (4247), 2791 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have 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:27:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:34,631 INFO L93 Difference]: Finished difference Result 2798 states and 4250 transitions. [2022-02-20 18:27:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4250 transitions. [2022-02-20 18:27:34,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:34,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:34,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 2792 states, 2791 states have (on average 1.5216768183446794) internal successors, (4247), 2791 states have internal predecessors, (4247), 0 states have call successors, (0), 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 2798 states. [2022-02-20 18:27:34,649 INFO L87 Difference]: Start difference. First operand has 2792 states, 2791 states have (on average 1.5216768183446794) internal successors, (4247), 2791 states have internal predecessors, (4247), 0 states have call successors, (0), 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 2798 states. [2022-02-20 18:27:34,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:34,962 INFO L93 Difference]: Finished difference Result 2798 states and 4250 transitions. [2022-02-20 18:27:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4250 transitions. [2022-02-20 18:27:34,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:34,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:34,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:34,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2791 states have (on average 1.5216768183446794) internal successors, (4247), 2791 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have 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:27:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4247 transitions. [2022-02-20 18:27:35,249 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4247 transitions. Word has length 57 [2022-02-20 18:27:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:35,249 INFO L470 AbstractCegarLoop]: Abstraction has 2792 states and 4247 transitions. [2022-02-20 18:27:35,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4247 transitions. [2022-02-20 18:27:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:27:35,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:35,251 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] [2022-02-20 18:27:35,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:27:35,251 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1296866655, now seen corresponding path program 1 times [2022-02-20 18:27:35,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:35,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029747155] [2022-02-20 18:27:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:35,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:35,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {25309#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(49, 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; {25309#true} is VALID [2022-02-20 18:27:35,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {25309#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {25309#true} is VALID [2022-02-20 18:27:35,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {25309#true} assume 0 == ~r1~0 % 256; {25309#true} is VALID [2022-02-20 18:27:35,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {25309#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {25309#true} is VALID [2022-02-20 18:27:35,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {25309#true} assume ~id1~0 >= 0; {25309#true} is VALID [2022-02-20 18:27:35,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {25309#true} assume 0 == ~st1~0; {25309#true} is VALID [2022-02-20 18:27:35,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {25309#true} assume ~send1~0 == ~id1~0; {25309#true} is VALID [2022-02-20 18:27:35,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {25309#true} assume 0 == ~mode1~0 % 256; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {25311#(= (+ (* (- 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;main_~i2~0#1 := 0; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;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; {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:35,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {25311#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {25310#false} is VALID [2022-02-20 18:27:35,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {25310#false} assume 255 == ~r1~0 % 256;~r1~0 := 3; {25310#false} is VALID [2022-02-20 18:27:35,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {25310#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {25310#false} is VALID [2022-02-20 18:27:35,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {25310#false} assume !(node1_~m1~0#1 != ~nomsg~0); {25310#false} is VALID [2022-02-20 18:27:35,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {25310#false} ~mode1~0 := 0; {25310#false} is VALID [2022-02-20 18:27:35,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {25310#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; {25310#false} is VALID [2022-02-20 18:27:35,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {25310#false} assume !(0 != ~mode2~0 % 256); {25310#false} is VALID [2022-02-20 18:27:35,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {25310#false} assume !(0 != ~alive2~0 % 256); {25310#false} is VALID [2022-02-20 18:27:35,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {25310#false} assume !(~send2~0 != ~id2~0); {25310#false} is VALID [2022-02-20 18:27:35,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {25310#false} ~mode2~0 := 1; {25310#false} is VALID [2022-02-20 18:27:35,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {25310#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; {25310#false} is VALID [2022-02-20 18:27:35,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {25310#false} assume !(0 != ~mode3~0 % 256); {25310#false} is VALID [2022-02-20 18:27:35,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {25310#false} assume !(0 != ~alive3~0 % 256); {25310#false} is VALID [2022-02-20 18:27:35,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {25310#false} assume !(~send3~0 != ~id3~0); {25310#false} is VALID [2022-02-20 18:27:35,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {25310#false} ~mode3~0 := 1; {25310#false} is VALID [2022-02-20 18:27:35,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {25310#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; {25310#false} is VALID [2022-02-20 18:27:35,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {25310#false} assume !(0 != ~mode4~0 % 256); {25310#false} is VALID [2022-02-20 18:27:35,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {25310#false} assume !(0 != ~alive4~0 % 256); {25310#false} is VALID [2022-02-20 18:27:35,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {25310#false} assume !(~send4~0 != ~id4~0); {25310#false} is VALID [2022-02-20 18:27:35,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {25310#false} ~mode4~0 := 1; {25310#false} is VALID [2022-02-20 18:27:35,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {25310#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25310#false} is VALID [2022-02-20 18:27:35,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {25310#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {25310#false} is VALID [2022-02-20 18:27:35,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {25310#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {25310#false} is VALID [2022-02-20 18:27:35,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {25310#false} check_#res#1 := check_~tmp~1#1; {25310#false} is VALID [2022-02-20 18:27:35,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {25310#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {25310#false} is VALID [2022-02-20 18:27:35,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {25310#false} assume 0 == assert_~arg#1 % 256; {25310#false} is VALID [2022-02-20 18:27:35,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {25310#false} assume !false; {25310#false} is VALID [2022-02-20 18:27:35,322 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:27:35,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:35,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029747155] [2022-02-20 18:27:35,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029747155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:35,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:35,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:35,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407928860] [2022-02-20 18:27:35,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:27:35,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:35,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:35,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:35,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:35,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:35,370 INFO L87 Difference]: Start difference. First operand 2792 states and 4247 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:39,140 INFO L93 Difference]: Finished difference Result 7468 states and 11289 transitions. [2022-02-20 18:27:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:27:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-02-20 18:27:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-02-20 18:27:39,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 331 transitions. [2022-02-20 18:27:39,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:40,064 INFO L225 Difference]: With dead ends: 7468 [2022-02-20 18:27:40,064 INFO L226 Difference]: Without dead ends: 4706 [2022-02-20 18:27:40,067 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:27:40,068 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 93 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 318 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:27:40,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 318 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2022-02-20 18:27:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 4704. [2022-02-20 18:27:41,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:41,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4706 states. Second operand has 4704 states, 4703 states have (on average 1.489900063789071) internal successors, (7007), 4703 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have 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:27:41,855 INFO L74 IsIncluded]: Start isIncluded. First operand 4706 states. Second operand has 4704 states, 4703 states have (on average 1.489900063789071) internal successors, (7007), 4703 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have 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:27:41,863 INFO L87 Difference]: Start difference. First operand 4706 states. Second operand has 4704 states, 4703 states have (on average 1.489900063789071) internal successors, (7007), 4703 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have 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:27:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:42,451 INFO L93 Difference]: Finished difference Result 4706 states and 7008 transitions. [2022-02-20 18:27:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4706 states and 7008 transitions. [2022-02-20 18:27:42,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:42,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:42,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 4704 states, 4703 states have (on average 1.489900063789071) internal successors, (7007), 4703 states have internal predecessors, (7007), 0 states have call successors, (0), 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 4706 states. [2022-02-20 18:27:42,473 INFO L87 Difference]: Start difference. First operand has 4704 states, 4703 states have (on average 1.489900063789071) internal successors, (7007), 4703 states have internal predecessors, (7007), 0 states have call successors, (0), 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 4706 states. [2022-02-20 18:27:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:43,098 INFO L93 Difference]: Finished difference Result 4706 states and 7008 transitions. [2022-02-20 18:27:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4706 states and 7008 transitions. [2022-02-20 18:27:43,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:43,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:43,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:43,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4704 states, 4703 states have (on average 1.489900063789071) internal successors, (7007), 4703 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have 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:27:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 7007 transitions. [2022-02-20 18:27:43,873 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 7007 transitions. Word has length 58 [2022-02-20 18:27:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:43,874 INFO L470 AbstractCegarLoop]: Abstraction has 4704 states and 7007 transitions. [2022-02-20 18:27:43,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 7007 transitions. [2022-02-20 18:27:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:27:43,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:43,875 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] [2022-02-20 18:27:43,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:27:43,875 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1866607497, now seen corresponding path program 1 times [2022-02-20 18:27:43,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:43,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947668073] [2022-02-20 18:27:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:43,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {48820#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(49, 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; {48820#true} is VALID [2022-02-20 18:27:43,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {48820#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {48820#true} is VALID [2022-02-20 18:27:43,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {48820#true} assume 0 == ~r1~0 % 256; {48820#true} is VALID [2022-02-20 18:27:43,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {48820#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {48820#true} is VALID [2022-02-20 18:27:43,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {48820#true} assume ~id1~0 >= 0; {48820#true} is VALID [2022-02-20 18:27:43,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {48820#true} assume 0 == ~st1~0; {48820#true} is VALID [2022-02-20 18:27:43,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {48820#true} assume ~send1~0 == ~id1~0; {48820#true} is VALID [2022-02-20 18:27:43,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {48820#true} assume 0 == ~mode1~0 % 256; {48820#true} is VALID [2022-02-20 18:27:43,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {48820#true} assume ~id2~0 >= 0; {48820#true} is VALID [2022-02-20 18:27:43,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {48820#true} assume 0 == ~st2~0; {48820#true} is VALID [2022-02-20 18:27:43,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {48820#true} assume ~send2~0 == ~id2~0; {48820#true} is VALID [2022-02-20 18:27:43,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {48820#true} assume 0 == ~mode2~0 % 256; {48820#true} is VALID [2022-02-20 18:27:43,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {48820#true} assume ~id3~0 >= 0; {48820#true} is VALID [2022-02-20 18:27:43,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {48820#true} assume 0 == ~st3~0; {48820#true} is VALID [2022-02-20 18:27:43,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {48820#true} assume ~send3~0 == ~id3~0; {48820#true} is VALID [2022-02-20 18:27:43,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {48820#true} assume 0 == ~mode3~0 % 256; {48820#true} is VALID [2022-02-20 18:27:43,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {48820#true} assume ~id4~0 >= 0; {48820#true} is VALID [2022-02-20 18:27:43,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {48820#true} assume 0 == ~st4~0; {48820#true} is VALID [2022-02-20 18:27:43,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {48820#true} assume ~send4~0 == ~id4~0; {48820#true} is VALID [2022-02-20 18:27:43,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {48820#true} assume 0 == ~mode4~0 % 256; {48820#true} is VALID [2022-02-20 18:27:43,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {48820#true} assume ~id1~0 != ~id2~0; {48820#true} is VALID [2022-02-20 18:27:43,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {48820#true} assume ~id1~0 != ~id3~0; {48820#true} is VALID [2022-02-20 18:27:43,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {48820#true} assume ~id1~0 != ~id4~0; {48820#true} is VALID [2022-02-20 18:27:43,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {48820#true} assume ~id2~0 != ~id3~0; {48820#true} is VALID [2022-02-20 18:27:43,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {48820#true} assume ~id2~0 != ~id4~0; {48820#true} is VALID [2022-02-20 18:27:43,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {48820#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {48822#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:27:43,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {48822#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {48823#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:27:43,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {48823#(= |ULTIMATE.start_init_#res#1| 1)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {48824#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 18:27:43,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {48824#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {48820#true} is VALID [2022-02-20 18:27:43,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {48820#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {48820#true} is VALID [2022-02-20 18:27:43,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {48820#true} assume !false;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; {48820#true} is VALID [2022-02-20 18:27:43,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {48820#true} assume !(0 != ~mode1~0 % 256); {48820#true} is VALID [2022-02-20 18:27:43,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {48820#true} assume !(0 != ~alive1~0 % 256); {48820#true} is VALID [2022-02-20 18:27:43,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {48820#true} assume !(~send1~0 != ~id1~0); {48820#true} is VALID [2022-02-20 18:27:43,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {48820#true} ~mode1~0 := 1; {48820#true} is VALID [2022-02-20 18:27:43,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {48820#true} 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; {48820#true} is VALID [2022-02-20 18:27:43,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {48820#true} assume !(0 != ~mode2~0 % 256); {48820#true} is VALID [2022-02-20 18:27:43,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {48820#true} assume 0 != ~alive2~0 % 256; {48820#true} is VALID [2022-02-20 18:27:43,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {48820#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {48820#true} is VALID [2022-02-20 18:27:43,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {48820#true} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {48820#true} is VALID [2022-02-20 18:27:43,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {48820#true} ~mode2~0 := 1; {48820#true} is VALID [2022-02-20 18:27:43,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {48820#true} 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; {48820#true} is VALID [2022-02-20 18:27:43,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {48820#true} assume !(0 != ~mode3~0 % 256); {48820#true} is VALID [2022-02-20 18:27:43,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {48820#true} assume !(0 != ~alive3~0 % 256); {48820#true} is VALID [2022-02-20 18:27:43,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {48820#true} assume !(~send3~0 != ~id3~0); {48820#true} is VALID [2022-02-20 18:27:43,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {48820#true} ~mode3~0 := 1; {48820#true} is VALID [2022-02-20 18:27:43,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {48820#true} 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; {48820#true} is VALID [2022-02-20 18:27:43,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {48820#true} assume !(0 != ~mode4~0 % 256); {48820#true} is VALID [2022-02-20 18:27:44,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {48820#true} assume !(0 != ~alive4~0 % 256); {48820#true} is VALID [2022-02-20 18:27:44,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {48820#true} assume !(~send4~0 != ~id4~0); {48820#true} is VALID [2022-02-20 18:27:44,000 INFO L290 TraceCheckUtils]: 50: Hoare triple {48820#true} ~mode4~0 := 1; {48820#true} is VALID [2022-02-20 18:27:44,000 INFO L290 TraceCheckUtils]: 51: Hoare triple {48820#true} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {48820#true} is VALID [2022-02-20 18:27:44,000 INFO L290 TraceCheckUtils]: 52: Hoare triple {48820#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {48820#true} is VALID [2022-02-20 18:27:44,001 INFO L290 TraceCheckUtils]: 53: Hoare triple {48820#true} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {48825#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:27:44,002 INFO L290 TraceCheckUtils]: 54: Hoare triple {48825#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {48826#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:27:44,002 INFO L290 TraceCheckUtils]: 55: Hoare triple {48826#(not (= 0 |ULTIMATE.start_check_#res#1|))} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {48827#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:27:44,003 INFO L290 TraceCheckUtils]: 56: Hoare triple {48827#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {48821#false} is VALID [2022-02-20 18:27:44,003 INFO L290 TraceCheckUtils]: 57: Hoare triple {48821#false} assume !false; {48821#false} is VALID [2022-02-20 18:27:44,003 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:27:44,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:44,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947668073] [2022-02-20 18:27:44,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947668073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:44,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:44,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:27:44,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147325317] [2022-02-20 18:27:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:44,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:27:44,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:44,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:44,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:44,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:27:44,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:44,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:27:44,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:27:44,050 INFO L87 Difference]: Start difference. First operand 4704 states and 7007 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:52,499 INFO L93 Difference]: Finished difference Result 9890 states and 14496 transitions. [2022-02-20 18:27:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:27:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:27:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2022-02-20 18:27:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2022-02-20 18:27:52,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 250 transitions. [2022-02-20 18:27:52,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:55,545 INFO L225 Difference]: With dead ends: 9890 [2022-02-20 18:27:55,545 INFO L226 Difference]: Without dead ends: 9888 [2022-02-20 18:27:55,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:27:55,547 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 783 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:55,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 663 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9888 states. [2022-02-20 18:27:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9888 to 5088. [2022-02-20 18:27:58,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:58,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9888 states. Second operand has 5088 states, 5087 states have (on average 1.4529192058187537) internal successors, (7391), 5087 states have internal predecessors, (7391), 0 states have call successors, (0), 0 states have 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:27:58,352 INFO L74 IsIncluded]: Start isIncluded. First operand 9888 states. Second operand has 5088 states, 5087 states have (on average 1.4529192058187537) internal successors, (7391), 5087 states have internal predecessors, (7391), 0 states have call successors, (0), 0 states have 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:27:58,360 INFO L87 Difference]: Start difference. First operand 9888 states. Second operand has 5088 states, 5087 states have (on average 1.4529192058187537) internal successors, (7391), 5087 states have internal predecessors, (7391), 0 states have call successors, (0), 0 states have 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:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:01,043 INFO L93 Difference]: Finished difference Result 9888 states and 14367 transitions. [2022-02-20 18:28:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9888 states and 14367 transitions. [2022-02-20 18:28:01,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:01,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:01,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 5088 states, 5087 states have (on average 1.4529192058187537) internal successors, (7391), 5087 states have internal predecessors, (7391), 0 states have call successors, (0), 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 9888 states. [2022-02-20 18:28:01,067 INFO L87 Difference]: Start difference. First operand has 5088 states, 5087 states have (on average 1.4529192058187537) internal successors, (7391), 5087 states have internal predecessors, (7391), 0 states have call successors, (0), 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 9888 states. [2022-02-20 18:28:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:03,763 INFO L93 Difference]: Finished difference Result 9888 states and 14367 transitions. [2022-02-20 18:28:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 9888 states and 14367 transitions. [2022-02-20 18:28:03,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:03,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:03,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:03,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5088 states, 5087 states have (on average 1.4529192058187537) internal successors, (7391), 5087 states have internal predecessors, (7391), 0 states have call successors, (0), 0 states have 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:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5088 states to 5088 states and 7391 transitions. [2022-02-20 18:28:04,604 INFO L78 Accepts]: Start accepts. Automaton has 5088 states and 7391 transitions. Word has length 58 [2022-02-20 18:28:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:04,604 INFO L470 AbstractCegarLoop]: Abstraction has 5088 states and 7391 transitions. [2022-02-20 18:28:04,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5088 states and 7391 transitions. [2022-02-20 18:28:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:28:04,605 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:04,605 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] [2022-02-20 18:28:04,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:28:04,605 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2082836158, now seen corresponding path program 1 times [2022-02-20 18:28:04,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:04,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431999794] [2022-02-20 18:28:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:04,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {86291#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(49, 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; {86291#true} is VALID [2022-02-20 18:28:04,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {86291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {86291#true} is VALID [2022-02-20 18:28:04,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {86291#true} assume 0 == ~r1~0 % 256; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;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; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~alive1~0 % 256); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send1~0 != ~id1~0); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode1~0 := 1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~alive2~0 % 256; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode2~0 := 1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~alive3~0 % 256); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~id3~0); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode3~0 := 1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,709 INFO L290 TraceCheckUtils]: 48: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~alive4~0 % 256); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send4~0 != ~id4~0); {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,710 INFO L290 TraceCheckUtils]: 50: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode4~0 := 1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,710 INFO L290 TraceCheckUtils]: 51: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:04,711 INFO L290 TraceCheckUtils]: 53: Hoare triple {86293#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 4); {86292#false} is VALID [2022-02-20 18:28:04,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {86292#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {86292#false} is VALID [2022-02-20 18:28:04,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {86292#false} check_#res#1 := check_~tmp~1#1; {86292#false} is VALID [2022-02-20 18:28:04,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {86292#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {86292#false} is VALID [2022-02-20 18:28:04,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {86292#false} assume 0 == assert_~arg#1 % 256; {86292#false} is VALID [2022-02-20 18:28:04,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {86292#false} assume !false; {86292#false} is VALID [2022-02-20 18:28:04,720 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:04,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:04,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431999794] [2022-02-20 18:28:04,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431999794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:04,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:04,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:04,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435182490] [2022-02-20 18:28:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:28:04,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:04,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:04,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:04,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:04,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:04,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:04,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:04,768 INFO L87 Difference]: Start difference. First operand 5088 states and 7391 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:13,841 INFO L93 Difference]: Finished difference Result 12334 states and 17947 transitions. [2022-02-20 18:28:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:28:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2022-02-20 18:28:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2022-02-20 18:28:13,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 343 transitions. [2022-02-20 18:28:14,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:15,887 INFO L225 Difference]: With dead ends: 12334 [2022-02-20 18:28:15,887 INFO L226 Difference]: Without dead ends: 7276 [2022-02-20 18:28:15,892 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:15,892 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 71 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:15,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 240 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7276 states. [2022-02-20 18:28:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7276 to 7218. [2022-02-20 18:28:19,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:19,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7276 states. Second operand has 7218 states, 7217 states have (on average 1.4433975336012193) internal successors, (10417), 7217 states have internal predecessors, (10417), 0 states have call successors, (0), 0 states have 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:19,842 INFO L74 IsIncluded]: Start isIncluded. First operand 7276 states. Second operand has 7218 states, 7217 states have (on average 1.4433975336012193) internal successors, (10417), 7217 states have internal predecessors, (10417), 0 states have call successors, (0), 0 states have 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:19,849 INFO L87 Difference]: Start difference. First operand 7276 states. Second operand has 7218 states, 7217 states have (on average 1.4433975336012193) internal successors, (10417), 7217 states have internal predecessors, (10417), 0 states have call successors, (0), 0 states have 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:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:21,339 INFO L93 Difference]: Finished difference Result 7276 states and 10474 transitions. [2022-02-20 18:28:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7276 states and 10474 transitions. [2022-02-20 18:28:21,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:21,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:21,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 7218 states, 7217 states have (on average 1.4433975336012193) internal successors, (10417), 7217 states have internal predecessors, (10417), 0 states have call successors, (0), 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 7276 states. [2022-02-20 18:28:21,359 INFO L87 Difference]: Start difference. First operand has 7218 states, 7217 states have (on average 1.4433975336012193) internal successors, (10417), 7217 states have internal predecessors, (10417), 0 states have call successors, (0), 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 7276 states. [2022-02-20 18:28:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,881 INFO L93 Difference]: Finished difference Result 7276 states and 10474 transitions. [2022-02-20 18:28:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7276 states and 10474 transitions. [2022-02-20 18:28:22,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:22,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:22,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:22,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7218 states, 7217 states have (on average 1.4433975336012193) internal successors, (10417), 7217 states have internal predecessors, (10417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)