./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 aa83d3f5173117ef698c13f0bcf19338ee3f6f59e63ac9b8ac7bd80f7d40c635 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:42:44,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:42:44,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:42:44,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:42:44,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:42:44,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:42:44,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:42:44,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:42:44,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:42:44,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:42:44,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:42:44,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:42:44,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:42:44,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:42:44,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:42:44,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:42:44,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:42:44,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:42:44,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:42:44,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:42:44,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:42:44,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:42:44,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:42:44,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:42:44,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:42:44,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:42:44,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:42:44,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:42:44,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:42:44,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:42:44,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:42:44,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:42:44,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:42:44,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:42:44,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:42:44,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:42:44,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:42:44,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:42:44,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:42:44,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:42:44,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:42:44,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:42:44,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:42:44,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:42:44,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:42:44,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:42:44,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:42:44,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:42:44,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:42:44,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:42:44,339 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:42:44,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:42:44,340 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:42:44,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:42:44,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:42:44,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:42:44,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:42:44,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:42:44,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:42:44,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:42:44,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:42:44,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:42:44,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:42:44,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:42:44,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:42:44,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:42:44,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:44,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:42:44,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:42:44,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:42:44,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:42:44,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:42:44,343 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:42:44,343 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:42:44,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:42:44,343 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 -> aa83d3f5173117ef698c13f0bcf19338ee3f6f59e63ac9b8ac7bd80f7d40c635 [2022-02-20 19:42:44,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:42:44,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:42:44,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:42:44,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:42:44,579 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:42:44,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:42:44,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207870048/0254750298004b5c81c489285e6056f1/FLAGf31b7d245 [2022-02-20 19:42:45,183 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:42:45,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:42:45,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207870048/0254750298004b5c81c489285e6056f1/FLAGf31b7d245 [2022-02-20 19:42:45,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207870048/0254750298004b5c81c489285e6056f1 [2022-02-20 19:42:45,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:42:45,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:42:45,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:45,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:42:45,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:42:45,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:45" (1/1) ... [2022-02-20 19:42:45,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dba4de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:45, skipping insertion in model container [2022-02-20 19:42:45,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:45" (1/1) ... [2022-02-20 19:42:45,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:42:45,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:42:46,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[8786,8799] [2022-02-20 19:42:46,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[14341,14354] [2022-02-20 19:42:46,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:46,591 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:42:46,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[8786,8799] [2022-02-20 19:42:46,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[14341,14354] [2022-02-20 19:42:47,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:47,021 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:42:47,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47 WrapperNode [2022-02-20 19:42:47,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:47,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:47,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:42:47,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:42:47,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,345 INFO L137 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5029 [2022-02-20 19:42:47,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:47,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:42:47,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:42:47,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:42:47,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:42:47,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:42:47,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:42:47,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:42:47,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (1/1) ... [2022-02-20 19:42:47,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:42:47,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:42:48,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:42:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:42:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:42:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:42:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:42:48,148 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:42:48,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:42:55,536 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:42:55,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:42:55,546 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:42:55,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:55 BoogieIcfgContainer [2022-02-20 19:42:55,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:42:55,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:42:55,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:42:55,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:42:55,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:42:45" (1/3) ... [2022-02-20 19:42:55,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e25258e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:55, skipping insertion in model container [2022-02-20 19:42:55,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:47" (2/3) ... [2022-02-20 19:42:55,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e25258e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:55, skipping insertion in model container [2022-02-20 19:42:55,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:55" (3/3) ... [2022-02-20 19:42:55,553 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:42:55,556 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:42:55,557 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:42:55,589 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:42:55,593 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:42:55,593 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:42:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:55,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:55,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:55,626 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1675876582, now seen corresponding path program 1 times [2022-02-20 19:42:55,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:55,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391515539] [2022-02-20 19:42:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:55,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {896#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {896#true} is VALID [2022-02-20 19:42:55,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {896#true} is VALID [2022-02-20 19:42:55,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {896#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {896#true} is VALID [2022-02-20 19:42:55,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {896#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {896#true} is VALID [2022-02-20 19:42:55,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {896#true} init_#res#1 := init_~tmp~0#1; {896#true} is VALID [2022-02-20 19:42:55,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {896#true} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {896#true} is VALID [2022-02-20 19:42:55,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {896#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {897#false} is VALID [2022-02-20 19:42:55,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {897#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {897#false} is VALID [2022-02-20 19:42:55,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {897#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:42:55,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {897#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:42:55,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {897#false} assume !(node1_~m1~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:42:55,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#false} ~mode1~0 := 0; {897#false} is VALID [2022-02-20 19:42:55,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:42:55,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:42:55,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {897#false} assume !(node2_~m2~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:42:55,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {897#false} ~mode2~0 := 0; {897#false} is VALID [2022-02-20 19:42:55,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {897#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:42:55,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {897#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:42:55,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {897#false} assume !(node3_~m3~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:42:55,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {897#false} ~mode3~0 := 0; {897#false} is VALID [2022-02-20 19:42:55,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {897#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:42:55,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {897#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:42:55,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {897#false} assume !(node4_~m4~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:42:55,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {897#false} ~mode4~0 := 0; {897#false} is VALID [2022-02-20 19:42:55,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#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; {897#false} is VALID [2022-02-20 19:42:55,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {897#false} is VALID [2022-02-20 19:42:55,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {897#false} check_#res#1 := check_~tmp~1#1; {897#false} is VALID [2022-02-20 19:42:55,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {897#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {897#false} is VALID [2022-02-20 19:42:55,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {897#false} assume 0 == assert_~arg#1 % 256; {897#false} is VALID [2022-02-20 19:42:55,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {897#false} assume !false; {897#false} is VALID [2022-02-20 19:42:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:42:55,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:55,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391515539] [2022-02-20 19:42:55,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391515539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:55,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:55,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:42:55,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276079731] [2022-02-20 19:42:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:55,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:42:55,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:55,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:55,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:55,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:42:55,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:55,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:42:55,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:42:55,826 INFO L87 Difference]: Start difference. First operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:57,053 INFO L93 Difference]: Finished difference Result 1755 states and 3330 transitions. [2022-02-20 19:42:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:42:57,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:42:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3330 transitions. [2022-02-20 19:42:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3330 transitions. [2022-02-20 19:42:57,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3330 transitions. [2022-02-20 19:42:59,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3330 edges. 3330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:59,627 INFO L225 Difference]: With dead ends: 1755 [2022-02-20 19:42:59,628 INFO L226 Difference]: Without dead ends: 827 [2022-02-20 19:42:59,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:42:59,645 INFO L933 BasicCegarLoop]: 1624 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, 1624 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:59,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-02-20 19:42:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-02-20 19:42:59,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:59,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:59,691 INFO L74 IsIncluded]: Start isIncluded. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:59,696 INFO L87 Difference]: Start difference. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:59,732 INFO L93 Difference]: Finished difference Result 827 states and 1560 transitions. [2022-02-20 19:42:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:42:59,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:59,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:59,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:42:59,741 INFO L87 Difference]: Start difference. First operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:42:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:59,830 INFO L93 Difference]: Finished difference Result 827 states and 1560 transitions. [2022-02-20 19:42:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:42:59,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:59,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:59,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:59,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1560 transitions. [2022-02-20 19:42:59,882 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1560 transitions. Word has length 30 [2022-02-20 19:42:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:59,883 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1560 transitions. [2022-02-20 19:42:59,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:42:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:59,884 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:59,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:59,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:42:59,884 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1541863076, now seen corresponding path program 1 times [2022-02-20 19:42:59,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:59,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735417428] [2022-02-20 19:42:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:00,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {5177#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5177#true} is VALID [2022-02-20 19:43:00,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {5177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {5177#true} is VALID [2022-02-20 19:43:00,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {5177#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5177#true} is VALID [2022-02-20 19:43:00,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {5177#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5179#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:43:00,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {5179#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5180#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:43:00,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {5180#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5181#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:43:00,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {5181#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5178#false} is VALID [2022-02-20 19:43:00,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {5178#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5178#false} is VALID [2022-02-20 19:43:00,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {5178#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:00,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {5178#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:00,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {5178#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5178#false} is VALID [2022-02-20 19:43:00,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {5178#false} ~mode1~0 := 0; {5178#false} is VALID [2022-02-20 19:43:00,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {5178#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:00,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {5178#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:00,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {5178#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5178#false} is VALID [2022-02-20 19:43:00,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {5178#false} ~mode2~0 := 0; {5178#false} is VALID [2022-02-20 19:43:00,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {5178#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:00,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {5178#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:00,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {5178#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5178#false} is VALID [2022-02-20 19:43:00,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {5178#false} ~mode3~0 := 0; {5178#false} is VALID [2022-02-20 19:43:00,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {5178#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:00,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {5178#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:00,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {5178#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5178#false} is VALID [2022-02-20 19:43:00,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {5178#false} ~mode4~0 := 0; {5178#false} is VALID [2022-02-20 19:43:00,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {5178#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; {5178#false} is VALID [2022-02-20 19:43:00,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {5178#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {5178#false} is VALID [2022-02-20 19:43:00,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {5178#false} check_#res#1 := check_~tmp~1#1; {5178#false} is VALID [2022-02-20 19:43:00,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {5178#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5178#false} is VALID [2022-02-20 19:43:00,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {5178#false} assume 0 == assert_~arg#1 % 256; {5178#false} is VALID [2022-02-20 19:43:00,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {5178#false} assume !false; {5178#false} is VALID [2022-02-20 19:43:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:00,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:00,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735417428] [2022-02-20 19:43:00,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735417428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:00,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:00,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:43:00,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529258074] [2022-02-20 19:43:00,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:43:00,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:00,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:00,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:00,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:43:00,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:43:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:43:00,040 INFO L87 Difference]: Start difference. First operand 827 states and 1560 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:03,826 INFO L93 Difference]: Finished difference Result 875 states and 1633 transitions. [2022-02-20 19:43:03,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:43:03,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:43:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1633 transitions. [2022-02-20 19:43:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1633 transitions. [2022-02-20 19:43:03,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1633 transitions. [2022-02-20 19:43:04,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1633 edges. 1633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:04,947 INFO L225 Difference]: With dead ends: 875 [2022-02-20 19:43:04,948 INFO L226 Difference]: Without dead ends: 827 [2022-02-20 19:43:04,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:43:04,949 INFO L933 BasicCegarLoop]: 1558 mSDtfsCounter, 3 mSDsluCounter, 4648 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6206 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:04,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6206 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-02-20 19:43:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-02-20 19:43:04,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:04,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:04,965 INFO L74 IsIncluded]: Start isIncluded. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:04,966 INFO L87 Difference]: Start difference. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:04,990 INFO L93 Difference]: Finished difference Result 827 states and 1537 transitions. [2022-02-20 19:43:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1537 transitions. [2022-02-20 19:43:04,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:04,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:04,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:43:04,995 INFO L87 Difference]: Start difference. First operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:43:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:05,020 INFO L93 Difference]: Finished difference Result 827 states and 1537 transitions. [2022-02-20 19:43:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1537 transitions. [2022-02-20 19:43:05,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:05,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:05,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:05,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1537 transitions. [2022-02-20 19:43:05,047 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1537 transitions. Word has length 30 [2022-02-20 19:43:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:05,047 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1537 transitions. [2022-02-20 19:43:05,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1537 transitions. [2022-02-20 19:43:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 19:43:05,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:05,049 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] [2022-02-20 19:43:05,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:43:05,050 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:05,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1620709547, now seen corresponding path program 1 times [2022-02-20 19:43:05,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:05,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937137893] [2022-02-20 19:43:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:05,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:05,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {8578#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {8580#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {8580#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet42#1);havoc main_#t~nondet42#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet40#1, main2_#t~ret41#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {8580#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet40#1 && main2_#t~nondet40#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet40#1;havoc main2_#t~nondet40#1; {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {8580#(<= 15 ~a24~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret37#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {8580#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8580#(<= 15 ~a24~0)} is VALID [2022-02-20 19:43:05,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {8580#(<= 15 ~a24~0)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {8579#false} is VALID [2022-02-20 19:43:05,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {8579#false} assume !false; {8579#false} is VALID [2022-02-20 19:43:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:05,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:05,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937137893] [2022-02-20 19:43:05,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937137893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:05,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:05,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:43:05,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656969113] [2022-02-20 19:43:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:43:05,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:05,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:05,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:05,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:05,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:05,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:05,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:05,240 INFO L87 Difference]: Start difference. First operand 827 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:09,860 INFO L93 Difference]: Finished difference Result 2331 states and 4410 transitions. [2022-02-20 19:43:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:09,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:43:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4410 transitions. [2022-02-20 19:43:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4410 transitions. [2022-02-20 19:43:09,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4410 transitions. [2022-02-20 19:43:12,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4410 edges. 4410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:12,418 INFO L225 Difference]: With dead ends: 2331 [2022-02-20 19:43:12,419 INFO L226 Difference]: Without dead ends: 1578 [2022-02-20 19:43:12,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:12,425 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 868 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:12,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [868 Valid, 526 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 19:43:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-02-20 19:43:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2022-02-20 19:43:12,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:12,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,457 INFO L74 IsIncluded]: Start isIncluded. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,460 INFO L87 Difference]: Start difference. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:12,543 INFO L93 Difference]: Finished difference Result 1578 states and 2564 transitions. [2022-02-20 19:43:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2564 transitions. [2022-02-20 19:43:12,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:12,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:12,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 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 1578 states. [2022-02-20 19:43:12,556 INFO L87 Difference]: Start difference. First operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 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 1578 states. [2022-02-20 19:43:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:12,632 INFO L93 Difference]: Finished difference Result 1578 states and 2564 transitions. [2022-02-20 19:43:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2564 transitions. [2022-02-20 19:43:12,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:12,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:12,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:12,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2564 transitions. [2022-02-20 19:43:12,740 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2564 transitions. Word has length 48 [2022-02-20 19:43:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:12,741 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2564 transitions. [2022-02-20 19:43:12,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2564 transitions. [2022-02-20 19:43:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:12,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:12,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:12,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:43:12,750 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash 159296799, now seen corresponding path program 1 times [2022-02-20 19:43:12,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:12,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565341724] [2022-02-20 19:43:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:12,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {15689#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {15689#true} is VALID [2022-02-20 19:43:12,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {15689#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {15689#true} is VALID [2022-02-20 19:43:12,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {15689#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15689#true} is VALID [2022-02-20 19:43:12,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {15689#true} assume 0 == ~r1~0 % 256; {15689#true} is VALID [2022-02-20 19:43:12,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {15689#true} assume ~id1~0 >= 0; {15689#true} is VALID [2022-02-20 19:43:12,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {15689#true} assume 0 == ~st1~0; {15689#true} is VALID [2022-02-20 19:43:12,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {15689#true} assume ~send1~0 == ~id1~0; {15689#true} is VALID [2022-02-20 19:43:12,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {15689#true} assume 0 == ~mode1~0 % 256; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:12,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {15691#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15690#false} is VALID [2022-02-20 19:43:12,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {15690#false} assume !(node1_~m1~0#1 != ~nomsg~0); {15690#false} is VALID [2022-02-20 19:43:12,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {15690#false} ~mode1~0 := 0; {15690#false} is VALID [2022-02-20 19:43:12,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {15690#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {15690#false} is VALID [2022-02-20 19:43:12,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {15690#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15690#false} is VALID [2022-02-20 19:43:12,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {15690#false} assume !(node2_~m2~0#1 != ~nomsg~0); {15690#false} is VALID [2022-02-20 19:43:12,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {15690#false} ~mode2~0 := 0; {15690#false} is VALID [2022-02-20 19:43:12,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {15690#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {15690#false} is VALID [2022-02-20 19:43:12,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {15690#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15690#false} is VALID [2022-02-20 19:43:12,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {15690#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15690#false} is VALID [2022-02-20 19:43:12,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {15690#false} ~mode3~0 := 0; {15690#false} is VALID [2022-02-20 19:43:12,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {15690#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {15690#false} is VALID [2022-02-20 19:43:12,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {15690#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15690#false} is VALID [2022-02-20 19:43:12,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {15690#false} assume !(node4_~m4~0#1 != ~nomsg~0); {15690#false} is VALID [2022-02-20 19:43:12,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {15690#false} ~mode4~0 := 0; {15690#false} is VALID [2022-02-20 19:43:12,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {15690#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; {15690#false} is VALID [2022-02-20 19:43:12,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {15690#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {15690#false} is VALID [2022-02-20 19:43:12,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {15690#false} check_#res#1 := check_~tmp~1#1; {15690#false} is VALID [2022-02-20 19:43:12,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {15690#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15690#false} is VALID [2022-02-20 19:43:12,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {15690#false} assume 0 == assert_~arg#1 % 256; {15690#false} is VALID [2022-02-20 19:43:12,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {15690#false} assume !false; {15690#false} is VALID [2022-02-20 19:43:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:12,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:12,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565341724] [2022-02-20 19:43:12,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565341724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:12,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:12,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:12,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568877750] [2022-02-20 19:43:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:12,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:12,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:12,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:12,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:12,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:12,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:12,923 INFO L87 Difference]: Start difference. First operand 1578 states and 2564 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:14,638 INFO L93 Difference]: Finished difference Result 1660 states and 2692 transitions. [2022-02-20 19:43:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:14,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:14,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:43:16,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:16,130 INFO L225 Difference]: With dead ends: 1660 [2022-02-20 19:43:16,131 INFO L226 Difference]: Without dead ends: 1616 [2022-02-20 19:43:16,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:16,138 INFO L933 BasicCegarLoop]: 1592 mSDtfsCounter, 1498 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:16,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1659 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2022-02-20 19:43:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1614. [2022-02-20 19:43:16,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:16,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,207 INFO L74 IsIncluded]: Start isIncluded. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,209 INFO L87 Difference]: Start difference. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:16,352 INFO L93 Difference]: Finished difference Result 1616 states and 2622 transitions. [2022-02-20 19:43:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2622 transitions. [2022-02-20 19:43:16,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:16,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:16,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 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 1616 states. [2022-02-20 19:43:16,358 INFO L87 Difference]: Start difference. First operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 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 1616 states. [2022-02-20 19:43:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:16,517 INFO L93 Difference]: Finished difference Result 1616 states and 2622 transitions. [2022-02-20 19:43:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2622 transitions. [2022-02-20 19:43:16,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:16,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:16,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:16,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2621 transitions. [2022-02-20 19:43:16,660 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2621 transitions. Word has length 52 [2022-02-20 19:43:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:16,660 INFO L470 AbstractCegarLoop]: Abstraction has 1614 states and 2621 transitions. [2022-02-20 19:43:16,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2621 transitions. [2022-02-20 19:43:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:16,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:16,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:16,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:43:16,662 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:16,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1780734059, now seen corresponding path program 1 times [2022-02-20 19:43:16,662 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:16,662 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013889001] [2022-02-20 19:43:16,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:16,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:16,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {22257#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {22257#true} is VALID [2022-02-20 19:43:16,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {22257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {22257#true} is VALID [2022-02-20 19:43:16,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {22257#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22257#true} is VALID [2022-02-20 19:43:16,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {22257#true} assume 0 == ~r1~0 % 256; {22257#true} is VALID [2022-02-20 19:43:16,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {22257#true} assume ~id1~0 >= 0; {22257#true} is VALID [2022-02-20 19:43:16,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {22257#true} assume 0 == ~st1~0; {22257#true} is VALID [2022-02-20 19:43:16,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {22257#true} assume ~send1~0 == ~id1~0; {22257#true} is VALID [2022-02-20 19:43:16,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {22257#true} assume 0 == ~mode1~0 % 256; {22257#true} is VALID [2022-02-20 19:43:16,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {22257#true} assume ~id2~0 >= 0; {22257#true} is VALID [2022-02-20 19:43:16,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {22257#true} assume 0 == ~st2~0; {22257#true} is VALID [2022-02-20 19:43:16,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {22257#true} assume ~send2~0 == ~id2~0; {22257#true} is VALID [2022-02-20 19:43:16,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {22257#true} assume 0 == ~mode2~0 % 256; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:16,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {22259#(= (+ (* (- 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; {22258#false} is VALID [2022-02-20 19:43:16,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {22258#false} assume !(node2_~m2~0#1 != ~nomsg~0); {22258#false} is VALID [2022-02-20 19:43:16,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {22258#false} ~mode2~0 := 0; {22258#false} is VALID [2022-02-20 19:43:16,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {22258#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22258#false} is VALID [2022-02-20 19:43:16,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {22258#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22258#false} is VALID [2022-02-20 19:43:16,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {22258#false} assume !(node3_~m3~0#1 != ~nomsg~0); {22258#false} is VALID [2022-02-20 19:43:16,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {22258#false} ~mode3~0 := 0; {22258#false} is VALID [2022-02-20 19:43:16,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {22258#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22258#false} is VALID [2022-02-20 19:43:16,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {22258#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22258#false} is VALID [2022-02-20 19:43:16,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {22258#false} assume !(node4_~m4~0#1 != ~nomsg~0); {22258#false} is VALID [2022-02-20 19:43:16,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {22258#false} ~mode4~0 := 0; {22258#false} is VALID [2022-02-20 19:43:16,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {22258#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; {22258#false} is VALID [2022-02-20 19:43:16,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {22258#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {22258#false} is VALID [2022-02-20 19:43:16,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {22258#false} check_#res#1 := check_~tmp~1#1; {22258#false} is VALID [2022-02-20 19:43:16,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {22258#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22258#false} is VALID [2022-02-20 19:43:16,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {22258#false} assume 0 == assert_~arg#1 % 256; {22258#false} is VALID [2022-02-20 19:43:16,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {22258#false} assume !false; {22258#false} is VALID [2022-02-20 19:43:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:16,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:16,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013889001] [2022-02-20 19:43:16,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013889001] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:16,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:16,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:16,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713574889] [2022-02-20 19:43:16,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:16,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:16,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:16,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:16,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:16,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:16,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:16,754 INFO L87 Difference]: Start difference. First operand 1614 states and 2621 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:18,481 INFO L93 Difference]: Finished difference Result 1762 states and 2853 transitions. [2022-02-20 19:43:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:18,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:18,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:43:19,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:20,080 INFO L225 Difference]: With dead ends: 1762 [2022-02-20 19:43:20,080 INFO L226 Difference]: Without dead ends: 1682 [2022-02-20 19:43:20,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:20,081 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 1494 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:20,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 1658 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2022-02-20 19:43:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1680. [2022-02-20 19:43:20,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:20,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:20,129 INFO L74 IsIncluded]: Start isIncluded. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:20,130 INFO L87 Difference]: Start difference. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:20,205 INFO L93 Difference]: Finished difference Result 1682 states and 2725 transitions. [2022-02-20 19:43:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2725 transitions. [2022-02-20 19:43:20,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:20,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:20,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 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 1682 states. [2022-02-20 19:43:20,212 INFO L87 Difference]: Start difference. First operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 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 1682 states. [2022-02-20 19:43:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:20,290 INFO L93 Difference]: Finished difference Result 1682 states and 2725 transitions. [2022-02-20 19:43:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2725 transitions. [2022-02-20 19:43:20,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:20,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:20,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:20,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2724 transitions. [2022-02-20 19:43:20,374 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2724 transitions. Word has length 52 [2022-02-20 19:43:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:20,374 INFO L470 AbstractCegarLoop]: Abstraction has 1680 states and 2724 transitions. [2022-02-20 19:43:20,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2724 transitions. [2022-02-20 19:43:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:20,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:20,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:20,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:43:20,375 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 919948555, now seen corresponding path program 1 times [2022-02-20 19:43:20,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:20,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852035459] [2022-02-20 19:43:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:20,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {29160#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29160#true} is VALID [2022-02-20 19:43:20,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {29160#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {29160#true} is VALID [2022-02-20 19:43:20,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {29160#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29160#true} is VALID [2022-02-20 19:43:20,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {29160#true} assume 0 == ~r1~0 % 256; {29160#true} is VALID [2022-02-20 19:43:20,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {29160#true} assume ~id1~0 >= 0; {29160#true} is VALID [2022-02-20 19:43:20,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {29160#true} assume 0 == ~st1~0; {29160#true} is VALID [2022-02-20 19:43:20,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {29160#true} assume ~send1~0 == ~id1~0; {29160#true} is VALID [2022-02-20 19:43:20,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {29160#true} assume 0 == ~mode1~0 % 256; {29160#true} is VALID [2022-02-20 19:43:20,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {29160#true} assume ~id2~0 >= 0; {29160#true} is VALID [2022-02-20 19:43:20,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {29160#true} assume 0 == ~st2~0; {29160#true} is VALID [2022-02-20 19:43:20,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {29160#true} assume ~send2~0 == ~id2~0; {29160#true} is VALID [2022-02-20 19:43:20,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {29160#true} assume 0 == ~mode2~0 % 256; {29160#true} is VALID [2022-02-20 19:43:20,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {29160#true} assume ~id3~0 >= 0; {29160#true} is VALID [2022-02-20 19:43:20,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {29160#true} assume 0 == ~st3~0; {29160#true} is VALID [2022-02-20 19:43:20,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {29160#true} assume ~send3~0 == ~id3~0; {29160#true} is VALID [2022-02-20 19:43:20,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {29160#true} assume 0 == ~mode3~0 % 256; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29162#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:20,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {29162#(= (+ (* (- 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; {29161#false} is VALID [2022-02-20 19:43:20,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {29161#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29161#false} is VALID [2022-02-20 19:43:20,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {29161#false} ~mode3~0 := 0; {29161#false} is VALID [2022-02-20 19:43:20,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {29161#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29161#false} is VALID [2022-02-20 19:43:20,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {29161#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29161#false} is VALID [2022-02-20 19:43:20,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {29161#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29161#false} is VALID [2022-02-20 19:43:20,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {29161#false} ~mode4~0 := 0; {29161#false} is VALID [2022-02-20 19:43:20,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {29161#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; {29161#false} is VALID [2022-02-20 19:43:20,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {29161#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {29161#false} is VALID [2022-02-20 19:43:20,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {29161#false} check_#res#1 := check_~tmp~1#1; {29161#false} is VALID [2022-02-20 19:43:20,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {29161#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29161#false} is VALID [2022-02-20 19:43:20,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {29161#false} assume 0 == assert_~arg#1 % 256; {29161#false} is VALID [2022-02-20 19:43:20,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {29161#false} assume !false; {29161#false} is VALID [2022-02-20 19:43:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:20,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:20,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852035459] [2022-02-20 19:43:20,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852035459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:20,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:20,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:20,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775609482] [2022-02-20 19:43:20,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:20,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:20,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:20,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:20,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:20,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:20,467 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:20,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:20,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:20,467 INFO L87 Difference]: Start difference. First operand 1680 states and 2724 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:22,306 INFO L93 Difference]: Finished difference Result 1948 states and 3142 transitions. [2022-02-20 19:43:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:22,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:43:23,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:23,858 INFO L225 Difference]: With dead ends: 1948 [2022-02-20 19:43:23,858 INFO L226 Difference]: Without dead ends: 1802 [2022-02-20 19:43:23,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:23,859 INFO L933 BasicCegarLoop]: 1582 mSDtfsCounter, 1490 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:23,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 1657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-02-20 19:43:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1800. [2022-02-20 19:43:23,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:23,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:23,909 INFO L74 IsIncluded]: Start isIncluded. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:23,911 INFO L87 Difference]: Start difference. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:23,997 INFO L93 Difference]: Finished difference Result 1802 states and 2909 transitions. [2022-02-20 19:43:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2909 transitions. [2022-02-20 19:43:23,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:23,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:24,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 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 1802 states. [2022-02-20 19:43:24,003 INFO L87 Difference]: Start difference. First operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 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 1802 states. [2022-02-20 19:43:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:24,088 INFO L93 Difference]: Finished difference Result 1802 states and 2909 transitions. [2022-02-20 19:43:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2909 transitions. [2022-02-20 19:43:24,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:24,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:24,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:24,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2908 transitions. [2022-02-20 19:43:24,181 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2908 transitions. Word has length 52 [2022-02-20 19:43:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:24,182 INFO L470 AbstractCegarLoop]: Abstraction has 1800 states and 2908 transitions. [2022-02-20 19:43:24,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2908 transitions. [2022-02-20 19:43:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:24,182 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:24,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:24,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:43:24,183 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1515907135, now seen corresponding path program 1 times [2022-02-20 19:43:24,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:24,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546287897] [2022-02-20 19:43:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:24,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {36679#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {36679#true} is VALID [2022-02-20 19:43:24,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {36679#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {36679#true} is VALID [2022-02-20 19:43:24,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {36679#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36679#true} is VALID [2022-02-20 19:43:24,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {36679#true} assume 0 == ~r1~0 % 256; {36679#true} is VALID [2022-02-20 19:43:24,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {36679#true} assume ~id1~0 >= 0; {36679#true} is VALID [2022-02-20 19:43:24,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {36679#true} assume 0 == ~st1~0; {36679#true} is VALID [2022-02-20 19:43:24,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {36679#true} assume ~send1~0 == ~id1~0; {36679#true} is VALID [2022-02-20 19:43:24,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {36679#true} assume 0 == ~mode1~0 % 256; {36679#true} is VALID [2022-02-20 19:43:24,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {36679#true} assume ~id2~0 >= 0; {36679#true} is VALID [2022-02-20 19:43:24,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {36679#true} assume 0 == ~st2~0; {36679#true} is VALID [2022-02-20 19:43:24,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {36679#true} assume ~send2~0 == ~id2~0; {36679#true} is VALID [2022-02-20 19:43:24,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {36679#true} assume 0 == ~mode2~0 % 256; {36679#true} is VALID [2022-02-20 19:43:24,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {36679#true} assume ~id3~0 >= 0; {36679#true} is VALID [2022-02-20 19:43:24,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {36679#true} assume 0 == ~st3~0; {36679#true} is VALID [2022-02-20 19:43:24,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {36679#true} assume ~send3~0 == ~id3~0; {36679#true} is VALID [2022-02-20 19:43:24,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {36679#true} assume 0 == ~mode3~0 % 256; {36679#true} is VALID [2022-02-20 19:43:24,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {36679#true} assume ~id4~0 >= 0; {36679#true} is VALID [2022-02-20 19:43:24,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {36679#true} assume 0 == ~st4~0; {36679#true} is VALID [2022-02-20 19:43:24,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {36679#true} assume ~send4~0 == ~id4~0; {36679#true} is VALID [2022-02-20 19:43:24,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {36679#true} assume 0 == ~mode4~0 % 256; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {36681#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:24,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {36681#(= (+ (* (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; {36680#false} is VALID [2022-02-20 19:43:24,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {36680#false} assume !(node4_~m4~0#1 != ~nomsg~0); {36680#false} is VALID [2022-02-20 19:43:24,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {36680#false} ~mode4~0 := 0; {36680#false} is VALID [2022-02-20 19:43:24,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {36680#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; {36680#false} is VALID [2022-02-20 19:43:24,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {36680#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {36680#false} is VALID [2022-02-20 19:43:24,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {36680#false} check_#res#1 := check_~tmp~1#1; {36680#false} is VALID [2022-02-20 19:43:24,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {36680#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36680#false} is VALID [2022-02-20 19:43:24,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {36680#false} assume 0 == assert_~arg#1 % 256; {36680#false} is VALID [2022-02-20 19:43:24,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {36680#false} assume !false; {36680#false} is VALID [2022-02-20 19:43:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:24,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:24,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546287897] [2022-02-20 19:43:24,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546287897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:24,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:24,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:24,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794812963] [2022-02-20 19:43:24,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:24,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:24,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:24,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:24,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:24,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:24,267 INFO L87 Difference]: Start difference. First operand 1800 states and 2908 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:26,085 INFO L93 Difference]: Finished difference Result 2284 states and 3654 transitions. [2022-02-20 19:43:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:26,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:26,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:43:27,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:27,703 INFO L225 Difference]: With dead ends: 2284 [2022-02-20 19:43:27,703 INFO L226 Difference]: Without dead ends: 2018 [2022-02-20 19:43:27,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:27,704 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1486 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:27,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 1656 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2022-02-20 19:43:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2016. [2022-02-20 19:43:27,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:27,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:27,789 INFO L74 IsIncluded]: Start isIncluded. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:27,790 INFO L87 Difference]: Start difference. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:27,898 INFO L93 Difference]: Finished difference Result 2018 states and 3233 transitions. [2022-02-20 19:43:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3233 transitions. [2022-02-20 19:43:27,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:27,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:27,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 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 2018 states. [2022-02-20 19:43:27,904 INFO L87 Difference]: Start difference. First operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 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 2018 states. [2022-02-20 19:43:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:28,025 INFO L93 Difference]: Finished difference Result 2018 states and 3233 transitions. [2022-02-20 19:43:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3233 transitions. [2022-02-20 19:43:28,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:28,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:28,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:28,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3232 transitions. [2022-02-20 19:43:28,165 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3232 transitions. Word has length 52 [2022-02-20 19:43:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:28,165 INFO L470 AbstractCegarLoop]: Abstraction has 2016 states and 3232 transitions. [2022-02-20 19:43:28,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3232 transitions. [2022-02-20 19:43:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:28,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:28,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:28,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:43:28,167 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:28,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1924545907, now seen corresponding path program 1 times [2022-02-20 19:43:28,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:28,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888143319] [2022-02-20 19:43:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:28,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:28,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {45322#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {45322#true} is VALID [2022-02-20 19:43:28,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {45322#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {45322#true} is VALID [2022-02-20 19:43:28,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {45322#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {45322#true} is VALID [2022-02-20 19:43:28,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {45322#true} assume 0 == ~r1~0 % 256; {45322#true} is VALID [2022-02-20 19:43:28,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {45322#true} assume ~id1~0 >= 0; {45322#true} is VALID [2022-02-20 19:43:28,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {45322#true} assume 0 == ~st1~0; {45324#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:28,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {45324#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {45324#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:28,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {45324#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {45324#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:28,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {45324#(<= ~st1~0 0)} assume ~id2~0 >= 0; {45324#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:28,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {45324#(<= ~st1~0 0)} assume 0 == ~st2~0; {45325#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {45325#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {45325#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {45325#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {45325#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {45325#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {45325#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {45325#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {45326#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {45326#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {45326#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {45326#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {45326#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {45326#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {45326#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {45326#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {45327#(<= (+ ~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; {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:28,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {45327#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {45323#false} is VALID [2022-02-20 19:43:28,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {45323#false} check_#res#1 := check_~tmp~1#1; {45323#false} is VALID [2022-02-20 19:43:28,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {45323#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {45323#false} is VALID [2022-02-20 19:43:28,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {45323#false} assume 0 == assert_~arg#1 % 256; {45323#false} is VALID [2022-02-20 19:43:28,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {45323#false} assume !false; {45323#false} is VALID [2022-02-20 19:43:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:28,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:28,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888143319] [2022-02-20 19:43:28,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888143319] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:28,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:28,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:43:28,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9818397] [2022-02-20 19:43:28,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:28,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:28,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:28,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:28,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:28,270 INFO L87 Difference]: Start difference. First operand 2016 states and 3232 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:33,164 INFO L93 Difference]: Finished difference Result 5872 states and 9128 transitions. [2022-02-20 19:43:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:43:33,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:43:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:43:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:43:33,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2089 transitions. [2022-02-20 19:43:34,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2089 edges. 2089 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:35,217 INFO L225 Difference]: With dead ends: 5872 [2022-02-20 19:43:35,217 INFO L226 Difference]: Without dead ends: 5390 [2022-02-20 19:43:35,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:43:35,225 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 6521 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6521 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:35,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6521 Valid, 2068 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2022-02-20 19:43:35,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 2496. [2022-02-20 19:43:35,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:35,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:35,714 INFO L74 IsIncluded]: Start isIncluded. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:35,715 INFO L87 Difference]: Start difference. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:36,715 INFO L93 Difference]: Finished difference Result 5390 states and 8263 transitions. [2022-02-20 19:43:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5390 states and 8263 transitions. [2022-02-20 19:43:36,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:36,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:36,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 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 5390 states. [2022-02-20 19:43:36,724 INFO L87 Difference]: Start difference. First operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 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 5390 states. [2022-02-20 19:43:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:37,482 INFO L93 Difference]: Finished difference Result 5390 states and 8263 transitions. [2022-02-20 19:43:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5390 states and 8263 transitions. [2022-02-20 19:43:37,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:37,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:37,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:37,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3936 transitions. [2022-02-20 19:43:37,687 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3936 transitions. Word has length 52 [2022-02-20 19:43:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:37,688 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 3936 transitions. [2022-02-20 19:43:37,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3936 transitions. [2022-02-20 19:43:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:37,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:37,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:37,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:43:37,689 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1236981091, now seen corresponding path program 1 times [2022-02-20 19:43:37,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:37,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896205878] [2022-02-20 19:43:37,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:37,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:37,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {65743#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {65743#true} is VALID [2022-02-20 19:43:37,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {65743#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {65743#true} is VALID [2022-02-20 19:43:37,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {65743#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {65743#true} is VALID [2022-02-20 19:43:37,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {65743#true} assume 0 == ~r1~0 % 256; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {65745#(<= ~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; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:37,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {65745#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {65744#false} is VALID [2022-02-20 19:43:37,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {65744#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {65744#false} is VALID [2022-02-20 19:43:37,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {65744#false} check_#res#1 := check_~tmp~1#1; {65744#false} is VALID [2022-02-20 19:43:37,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {65744#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {65744#false} is VALID [2022-02-20 19:43:37,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {65744#false} assume 0 == assert_~arg#1 % 256; {65744#false} is VALID [2022-02-20 19:43:37,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {65744#false} assume !false; {65744#false} is VALID [2022-02-20 19:43:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:37,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:37,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896205878] [2022-02-20 19:43:37,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896205878] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:37,777 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:37,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:37,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160049022] [2022-02-20 19:43:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:37,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:37,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:37,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:37,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:37,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:37,830 INFO L87 Difference]: Start difference. First operand 2496 states and 3936 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:40,510 INFO L93 Difference]: Finished difference Result 3902 states and 6036 transitions. [2022-02-20 19:43:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:40,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1666 transitions. [2022-02-20 19:43:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1666 transitions. [2022-02-20 19:43:40,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1666 transitions. [2022-02-20 19:43:41,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1666 edges. 1666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:42,042 INFO L225 Difference]: With dead ends: 3902 [2022-02-20 19:43:42,042 INFO L226 Difference]: Without dead ends: 2940 [2022-02-20 19:43:42,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:42,044 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1478 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1623 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 19:43:42,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 1623 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-02-20 19:43:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2022-02-20 19:43:42,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:42,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5565395095367847) internal successors, (4570), 2937 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:42,831 INFO L74 IsIncluded]: Start isIncluded. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5565395095367847) internal successors, (4570), 2937 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:42,833 INFO L87 Difference]: Start difference. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5565395095367847) internal successors, (4570), 2937 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:43,042 INFO L93 Difference]: Finished difference Result 2940 states and 4571 transitions. [2022-02-20 19:43:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4571 transitions. [2022-02-20 19:43:43,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:43,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:43,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 2938 states, 2936 states have (on average 1.5565395095367847) internal successors, (4570), 2937 states have internal predecessors, (4570), 0 states have call successors, (0), 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 2940 states. [2022-02-20 19:43:43,050 INFO L87 Difference]: Start difference. First operand has 2938 states, 2936 states have (on average 1.5565395095367847) internal successors, (4570), 2937 states have internal predecessors, (4570), 0 states have call successors, (0), 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 2940 states. [2022-02-20 19:43:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:43,263 INFO L93 Difference]: Finished difference Result 2940 states and 4571 transitions. [2022-02-20 19:43:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4571 transitions. [2022-02-20 19:43:43,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:43,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:43,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:43,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.5565395095367847) internal successors, (4570), 2937 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4570 transitions. [2022-02-20 19:43:43,525 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4570 transitions. Word has length 54 [2022-02-20 19:43:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:43,525 INFO L470 AbstractCegarLoop]: Abstraction has 2938 states and 4570 transitions. [2022-02-20 19:43:43,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4570 transitions. [2022-02-20 19:43:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:43,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:43,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:43,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:43:43,526 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1303474603, now seen corresponding path program 1 times [2022-02-20 19:43:43,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:43,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519608517] [2022-02-20 19:43:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:43,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {79372#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {79372#true} is VALID [2022-02-20 19:43:43,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {79372#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {79372#true} is VALID [2022-02-20 19:43:43,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {79372#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {79372#true} is VALID [2022-02-20 19:43:43,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {79372#true} assume 0 == ~r1~0 % 256; {79372#true} is VALID [2022-02-20 19:43:43,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {79372#true} assume ~id1~0 >= 0; {79372#true} is VALID [2022-02-20 19:43:43,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {79372#true} assume 0 == ~st1~0; {79374#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:43,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {79374#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {79374#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:43,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {79374#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {79374#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:43,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {79374#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {79374#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:43,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {79374#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {79375#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:43,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {79375#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {79375#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:43,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {79375#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {79375#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:43,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {79375#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {79375#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:43,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {79375#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {79376#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:43,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {79376#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {79376#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:43,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {79376#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {79376#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:43,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {79376#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {79376#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:43,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {79376#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == assume_abort_if_not_~cond#1); {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,672 INFO L290 TraceCheckUtils]: 47: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:43,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {79377#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {79373#false} is VALID [2022-02-20 19:43:43,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {79373#false} check_#res#1 := check_~tmp~1#1; {79373#false} is VALID [2022-02-20 19:43:43,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {79373#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {79373#false} is VALID [2022-02-20 19:43:43,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {79373#false} assume 0 == assert_~arg#1 % 256; {79373#false} is VALID [2022-02-20 19:43:43,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {79373#false} assume !false; {79373#false} is VALID [2022-02-20 19:43:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:43,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:43,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519608517] [2022-02-20 19:43:43,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519608517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:43,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:43,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:43:43,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124037880] [2022-02-20 19:43:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:43,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:43,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:43,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:43,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:43,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:43,710 INFO L87 Difference]: Start difference. First operand 2938 states and 4570 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:48,648 INFO L93 Difference]: Finished difference Result 4342 states and 6644 transitions. [2022-02-20 19:43:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:43:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2022-02-20 19:43:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2022-02-20 19:43:48,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1673 transitions. [2022-02-20 19:43:50,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1673 edges. 1673 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:50,325 INFO L225 Difference]: With dead ends: 4342 [2022-02-20 19:43:50,325 INFO L226 Difference]: Without dead ends: 2940 [2022-02-20 19:43:50,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:43:50,327 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 6036 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6036 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:50,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6036 Valid, 1726 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-02-20 19:43:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2022-02-20 19:43:51,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:51,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5483651226158037) internal successors, (4546), 2937 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:51,283 INFO L74 IsIncluded]: Start isIncluded. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5483651226158037) internal successors, (4546), 2937 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:51,285 INFO L87 Difference]: Start difference. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5483651226158037) internal successors, (4546), 2937 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:51,499 INFO L93 Difference]: Finished difference Result 2940 states and 4547 transitions. [2022-02-20 19:43:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4547 transitions. [2022-02-20 19:43:51,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:51,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:51,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 2938 states, 2936 states have (on average 1.5483651226158037) internal successors, (4546), 2937 states have internal predecessors, (4546), 0 states have call successors, (0), 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 2940 states. [2022-02-20 19:43:51,506 INFO L87 Difference]: Start difference. First operand has 2938 states, 2936 states have (on average 1.5483651226158037) internal successors, (4546), 2937 states have internal predecessors, (4546), 0 states have call successors, (0), 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 2940 states. [2022-02-20 19:43:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:51,759 INFO L93 Difference]: Finished difference Result 2940 states and 4547 transitions. [2022-02-20 19:43:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4547 transitions. [2022-02-20 19:43:51,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:51,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:51,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:51,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.5483651226158037) internal successors, (4546), 2937 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4546 transitions. [2022-02-20 19:43:52,130 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4546 transitions. Word has length 54 [2022-02-20 19:43:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:52,131 INFO L470 AbstractCegarLoop]: Abstraction has 2938 states and 4546 transitions. [2022-02-20 19:43:52,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4546 transitions. [2022-02-20 19:43:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:43:52,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:52,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] [2022-02-20 19:43:52,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:43:52,132 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1338283904, now seen corresponding path program 1 times [2022-02-20 19:43:52,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:52,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32040875] [2022-02-20 19:43:52,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:52,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {93552#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {93554#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:43:52,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {93554#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {93555#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 19:43:52,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {93555#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {93555#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 19:43:52,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {93555#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} init_#res#1 := init_~tmp~0#1; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == assume_abort_if_not_~cond#1); {93556#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:43:52,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {93556#(<= (+ ~nomsg~0 1) ~send4~0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode1~0 % 256); {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode2~0 % 256); {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode3~0 % 256); {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode4~0 % 256); {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:43:52,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {93557#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {93553#false} is VALID [2022-02-20 19:43:52,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {93553#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {93553#false} is VALID [2022-02-20 19:43:52,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {93553#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; {93553#false} is VALID [2022-02-20 19:43:52,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {93553#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {93553#false} is VALID [2022-02-20 19:43:52,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {93553#false} assume !(~r1~0 % 256 >= 4); {93553#false} is VALID [2022-02-20 19:43:52,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {93553#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {93553#false} is VALID [2022-02-20 19:43:52,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {93553#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {93553#false} is VALID [2022-02-20 19:43:52,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {93553#false} check_#res#1 := check_~tmp~1#1; {93553#false} is VALID [2022-02-20 19:43:52,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {93553#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {93553#false} is VALID [2022-02-20 19:43:52,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {93553#false} assume 0 == assert_~arg#1 % 256; {93553#false} is VALID [2022-02-20 19:43:52,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {93553#false} assume !false; {93553#false} is VALID [2022-02-20 19:43:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:43:52,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:52,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32040875] [2022-02-20 19:43:52,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32040875] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:52,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:52,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:43:52,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289661450] [2022-02-20 19:43:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 19:43:52,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:52,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:52,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:52,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:52,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:52,287 INFO L87 Difference]: Start difference. First operand 2938 states and 4546 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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)