./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.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.3.ufo.UNBOUNDED.pals+Problem12_label07.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 3c4a130150e3546b51c6f5052a66be25e85ab754f6eb3524346398a032a444aa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:39:59,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:39:59,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:39:59,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:39:59,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:39:59,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:39:59,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:39:59,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:39:59,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:39:59,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:39:59,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:39:59,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:39:59,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:39:59,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:39:59,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:39:59,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:39:59,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:39:59,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:39:59,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:39:59,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:39:59,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:39:59,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:39:59,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:39:59,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:39:59,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:39:59,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:39:59,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:39:59,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:39:59,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:39:59,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:39:59,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:39:59,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:39:59,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:39:59,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:39:59,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:39:59,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:39:59,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:39:59,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:39:59,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:39:59,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:39:59,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:39:59,455 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:39:59,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:39:59,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:39:59,477 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:39:59,477 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:39:59,478 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:39:59,478 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:39:59,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:39:59,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:39:59,479 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:39:59,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:39:59,479 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:39:59,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:39:59,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:39:59,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:39:59,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:39:59,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:39:59,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:39:59,480 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:39:59,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:39:59,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:39:59,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:39:59,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:39:59,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:39:59,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:39:59,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:59,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:39:59,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:39:59,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:39:59,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:39:59,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:39:59,482 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:39:59,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:39:59,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:39:59,483 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 -> 3c4a130150e3546b51c6f5052a66be25e85ab754f6eb3524346398a032a444aa [2022-02-20 19:39:59,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:39:59,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:39:59,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:39:59,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:39:59,714 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:39:59,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:39:59,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92191ef56/827dcad15ad3485cbc01cd50aaa3a36c/FLAGed3a48b38 [2022-02-20 19:40:00,238 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:40:00,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:40:00,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92191ef56/827dcad15ad3485cbc01cd50aaa3a36c/FLAGed3a48b38 [2022-02-20 19:40:00,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92191ef56/827dcad15ad3485cbc01cd50aaa3a36c [2022-02-20 19:40:00,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:40:00,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:40:00,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:00,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:40:00,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:40:00,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:00" (1/1) ... [2022-02-20 19:40:00,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e44aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:00, skipping insertion in model container [2022-02-20 19:40:00,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:00" (1/1) ... [2022-02-20 19:40:00,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:40:00,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:40:00,878 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.3.ufo.UNBOUNDED.pals+Problem12_label07.c[6450,6463] [2022-02-20 19:40:00,893 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.3.ufo.UNBOUNDED.pals+Problem12_label07.c[7292,7305] [2022-02-20 19:40:01,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:01,430 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:40:01,462 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.3.ufo.UNBOUNDED.pals+Problem12_label07.c[6450,6463] [2022-02-20 19:40:01,464 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.3.ufo.UNBOUNDED.pals+Problem12_label07.c[7292,7305] [2022-02-20 19:40:01,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:01,809 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:40:01,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01 WrapperNode [2022-02-20 19:40:01,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:01,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:01,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:40:01,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:40:01,816 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:40:01" (1/1) ... [2022-02-20 19:40:01,864 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:40:01" (1/1) ... [2022-02-20 19:40:02,222 INFO L137 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4976 [2022-02-20 19:40:02,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:02,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:40:02,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:40:02,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:40:02,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:02,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:02,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:02,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:02,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:02,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:02,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:02,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:40:02,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:40:02,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:40:02,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:40:02,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:02,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:40:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:40:02,636 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:40:02,644 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:40:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:40:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:40:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:40:02,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:40:02,748 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:40:02,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:40:09,328 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:40:09,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:40:09,344 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:40:09,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:09 BoogieIcfgContainer [2022-02-20 19:40:09,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:40:09,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:40:09,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:40:09,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:40:09,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:40:00" (1/3) ... [2022-02-20 19:40:09,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195699d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:09, skipping insertion in model container [2022-02-20 19:40:09,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01" (2/3) ... [2022-02-20 19:40:09,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195699d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:09, skipping insertion in model container [2022-02-20 19:40:09,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:09" (3/3) ... [2022-02-20 19:40:09,359 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:40:09,363 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:40:09,363 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:40:09,399 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:40:09,404 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:40:09,404 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:40:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 880 states, 877 states have (on average 1.903078677309008) internal successors, (1669), 879 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have 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:40:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 19:40:09,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:09,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:09,446 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2063738936, now seen corresponding path program 1 times [2022-02-20 19:40:09,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:09,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431592686] [2022-02-20 19:40:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:09,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:09,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {885#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:09,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {885#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:09,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet35#1, main2_#t~ret36#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {885#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:09,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {885#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet35#1 && main2_#t~nondet35#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet35#1;havoc main2_#t~nondet35#1; {885#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:09,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {885#(<= 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~ret32#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {885#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:09,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#(<= 15 ~a24~0)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {884#false} is VALID [2022-02-20 19:40:09,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-02-20 19:40:09,601 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:40:09,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:09,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431592686] [2022-02-20 19:40:09,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431592686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:09,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:09,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:40:09,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766662896] [2022-02-20 19:40:09,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:09,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 19:40:09,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:09,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:40:09,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:09,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:09,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:09,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:09,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:09,644 INFO L87 Difference]: Start difference. First operand has 880 states, 877 states have (on average 1.903078677309008) internal successors, (1669), 879 states have internal predecessors, (1669), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:40:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:15,164 INFO L93 Difference]: Finished difference Result 2491 states and 4798 transitions. [2022-02-20 19:40:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:15,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 19:40:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:40:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4798 transitions. [2022-02-20 19:40:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:40:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4798 transitions. [2022-02-20 19:40:15,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4798 transitions. [2022-02-20 19:40:18,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4798 edges. 4798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:18,952 INFO L225 Difference]: With dead ends: 2491 [2022-02-20 19:40:18,952 INFO L226 Difference]: Without dead ends: 1565 [2022-02-20 19:40:18,959 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:40:18,961 INFO L933 BasicCegarLoop]: 569 mSDtfsCounter, 925 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:18,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [925 Valid, 580 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:40:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-02-20 19:40:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-02-20 19:40:19,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:19,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6397952655150352) internal successors, (2563), 1564 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have 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:40:19,077 INFO L74 IsIncluded]: Start isIncluded. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6397952655150352) internal successors, (2563), 1564 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have 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:40:19,080 INFO L87 Difference]: Start difference. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6397952655150352) internal successors, (2563), 1564 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have 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:40:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:19,166 INFO L93 Difference]: Finished difference Result 1565 states and 2563 transitions. [2022-02-20 19:40:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2563 transitions. [2022-02-20 19:40:19,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:19,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:19,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 1565 states, 1563 states have (on average 1.6397952655150352) internal successors, (2563), 1564 states have internal predecessors, (2563), 0 states have call successors, (0), 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 1565 states. [2022-02-20 19:40:19,178 INFO L87 Difference]: Start difference. First operand has 1565 states, 1563 states have (on average 1.6397952655150352) internal successors, (2563), 1564 states have internal predecessors, (2563), 0 states have call successors, (0), 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 1565 states. [2022-02-20 19:40:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:19,262 INFO L93 Difference]: Finished difference Result 1565 states and 2563 transitions. [2022-02-20 19:40:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2563 transitions. [2022-02-20 19:40:19,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:19,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:19,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:19,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1563 states have (on average 1.6397952655150352) internal successors, (2563), 1564 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have 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:40:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2563 transitions. [2022-02-20 19:40:19,360 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2563 transitions. Word has length 7 [2022-02-20 19:40:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:19,360 INFO L470 AbstractCegarLoop]: Abstraction has 1565 states and 2563 transitions. [2022-02-20 19:40:19,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:40:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2563 transitions. [2022-02-20 19:40:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:19,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:19,361 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] [2022-02-20 19:40:19,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:40:19,362 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash 783737522, now seen corresponding path program 1 times [2022-02-20 19:40:19,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:19,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166901440] [2022-02-20 19:40:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:19,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {8123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {8123#true} is VALID [2022-02-20 19:40:19,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {8123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {8123#true} is VALID [2022-02-20 19:40:19,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {8123#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8123#true} is VALID [2022-02-20 19:40:19,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {8123#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8125#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:40:19,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {8125#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8126#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:40:19,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {8126#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {8127#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:40:19,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {8127#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8124#false} is VALID [2022-02-20 19:40:19,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {8124#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;main1_~i2~0#1 := 0; {8124#false} is VALID [2022-02-20 19:40:19,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {8124#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; {8124#false} is VALID [2022-02-20 19:40:19,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {8124#false} assume !(0 != ~mode1~0 % 256); {8124#false} is VALID [2022-02-20 19:40:19,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {8124#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8124#false} is VALID [2022-02-20 19:40:19,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {8124#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8124#false} is VALID [2022-02-20 19:40:19,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {8124#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; {8124#false} is VALID [2022-02-20 19:40:19,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {8124#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8124#false} is VALID [2022-02-20 19:40:19,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {8124#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8124#false} is VALID [2022-02-20 19:40:19,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {8124#false} ~mode2~0 := 0; {8124#false} is VALID [2022-02-20 19:40:19,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {8124#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; {8124#false} is VALID [2022-02-20 19:40:19,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {8124#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8124#false} is VALID [2022-02-20 19:40:19,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {8124#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8124#false} is VALID [2022-02-20 19:40:19,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {8124#false} ~mode3~0 := 0; {8124#false} is VALID [2022-02-20 19:40:19,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {8124#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8124#false} is VALID [2022-02-20 19:40:19,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {8124#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8124#false} is VALID [2022-02-20 19:40:19,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {8124#false} check_#res#1 := check_~tmp~1#1; {8124#false} is VALID [2022-02-20 19:40:19,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {8124#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {8124#false} is VALID [2022-02-20 19:40:19,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {8124#false} assume 0 == assert_~arg#1 % 256; {8124#false} is VALID [2022-02-20 19:40:19,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {8124#false} assume !false; {8124#false} is VALID [2022-02-20 19:40:19,445 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:40:19,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:19,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166901440] [2022-02-20 19:40:19,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166901440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:19,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:19,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:19,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510324927] [2022-02-20 19:40:19,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:19,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:19,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:19,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:19,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:19,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:19,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:19,464 INFO L87 Difference]: Start difference. First operand 1565 states and 2563 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:23,343 INFO L93 Difference]: Finished difference Result 1607 states and 2626 transitions. [2022-02-20 19:40:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:23,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:23,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-02-20 19:40:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-02-20 19:40:23,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1599 transitions. [2022-02-20 19:40:24,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1599 edges. 1599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:24,667 INFO L225 Difference]: With dead ends: 1607 [2022-02-20 19:40:24,667 INFO L226 Difference]: Without dead ends: 1565 [2022-02-20 19:40:24,668 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:40:24,669 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3 mSDsluCounter, 4583 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6117 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:24,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6117 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-02-20 19:40:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-02-20 19:40:24,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:24,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:40:24,699 INFO L74 IsIncluded]: Start isIncluded. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:40:24,701 INFO L87 Difference]: Start difference. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:40:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:24,788 INFO L93 Difference]: Finished difference Result 1565 states and 2547 transitions. [2022-02-20 19:40:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2547 transitions. [2022-02-20 19:40:24,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:24,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:24,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 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 1565 states. [2022-02-20 19:40:24,796 INFO L87 Difference]: Start difference. First operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 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 1565 states. [2022-02-20 19:40:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:24,885 INFO L93 Difference]: Finished difference Result 1565 states and 2547 transitions. [2022-02-20 19:40:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2547 transitions. [2022-02-20 19:40:24,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:24,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:24,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:24,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:40:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2547 transitions. [2022-02-20 19:40:24,989 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2547 transitions. Word has length 26 [2022-02-20 19:40:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:24,990 INFO L470 AbstractCegarLoop]: Abstraction has 1565 states and 2547 transitions. [2022-02-20 19:40:24,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2547 transitions. [2022-02-20 19:40:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:24,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:24,992 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] [2022-02-20 19:40:24,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:40:24,993 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash -698732182, now seen corresponding path program 1 times [2022-02-20 19:40:24,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:24,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916793303] [2022-02-20 19:40:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:24,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:25,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {14477#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {14477#true} is VALID [2022-02-20 19:40:25,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {14477#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {14477#true} is VALID [2022-02-20 19:40:25,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {14477#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14477#true} is VALID [2022-02-20 19:40:25,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {14477#true} assume 0 == ~r1~0 % 256; {14477#true} is VALID [2022-02-20 19:40:25,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {14477#true} assume ~id1~0 >= 0; {14477#true} is VALID [2022-02-20 19:40:25,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {14477#true} assume 0 == ~st1~0; {14477#true} is VALID [2022-02-20 19:40:25,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {14477#true} assume ~send1~0 == ~id1~0; {14477#true} is VALID [2022-02-20 19:40:25,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {14477#true} assume 0 == ~mode1~0 % 256; {14477#true} is VALID [2022-02-20 19:40:25,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {14477#true} assume ~id2~0 >= 0; {14477#true} is VALID [2022-02-20 19:40:25,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {14477#true} assume 0 == ~st2~0; {14477#true} is VALID [2022-02-20 19:40:25,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {14477#true} assume ~send2~0 == ~id2~0; {14477#true} is VALID [2022-02-20 19:40:25,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {14477#true} assume 0 == ~mode2~0 % 256; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {14479#(= (+ (* (- 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;main1_~i2~0#1 := 0; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {14479#(= (+ (* (- 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; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {14479#(= (+ (* (- 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; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {14479#(= (+ (* (- 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; {14479#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:25,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {14479#(= (+ (* (- 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; {14478#false} is VALID [2022-02-20 19:40:25,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {14478#false} assume !(node2_~m2~0#1 != ~nomsg~0); {14478#false} is VALID [2022-02-20 19:40:25,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {14478#false} ~mode2~0 := 0; {14478#false} is VALID [2022-02-20 19:40:25,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {14478#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; {14478#false} is VALID [2022-02-20 19:40:25,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {14478#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14478#false} is VALID [2022-02-20 19:40:25,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {14478#false} assume !(node3_~m3~0#1 != ~nomsg~0); {14478#false} is VALID [2022-02-20 19:40:25,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {14478#false} ~mode3~0 := 0; {14478#false} is VALID [2022-02-20 19:40:25,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {14478#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14478#false} is VALID [2022-02-20 19:40:25,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {14478#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {14478#false} is VALID [2022-02-20 19:40:25,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {14478#false} check_#res#1 := check_~tmp~1#1; {14478#false} is VALID [2022-02-20 19:40:25,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {14478#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {14478#false} is VALID [2022-02-20 19:40:25,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {14478#false} assume 0 == assert_~arg#1 % 256; {14478#false} is VALID [2022-02-20 19:40:25,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {14478#false} assume !false; {14478#false} is VALID [2022-02-20 19:40:25,129 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:40:25,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:25,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916793303] [2022-02-20 19:40:25,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916793303] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:25,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:25,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:25,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482576048] [2022-02-20 19:40:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:25,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:25,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:25,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:25,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:25,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:25,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:25,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:25,160 INFO L87 Difference]: Start difference. First operand 1565 states and 2547 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:26,828 INFO L93 Difference]: Finished difference Result 1635 states and 2655 transitions. [2022-02-20 19:40:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:26,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:26,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1628 transitions. [2022-02-20 19:40:28,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:28,370 INFO L225 Difference]: With dead ends: 1635 [2022-02-20 19:40:28,370 INFO L226 Difference]: Without dead ends: 1597 [2022-02-20 19:40:28,371 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:40:28,372 INFO L933 BasicCegarLoop]: 1549 mSDtfsCounter, 1484 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1610 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:40:28,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 1610 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-02-20 19:40:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1595. [2022-02-20 19:40:28,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:28,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1597 states. Second operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:40:28,407 INFO L74 IsIncluded]: Start isIncluded. First operand 1597 states. Second operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:40:28,410 INFO L87 Difference]: Start difference. First operand 1597 states. Second operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:40:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:28,501 INFO L93 Difference]: Finished difference Result 1597 states and 2595 transitions. [2022-02-20 19:40:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2595 transitions. [2022-02-20 19:40:28,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:28,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:28,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 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 1597 states. [2022-02-20 19:40:28,516 INFO L87 Difference]: Start difference. First operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 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 1597 states. [2022-02-20 19:40:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:28,615 INFO L93 Difference]: Finished difference Result 1597 states and 2595 transitions. [2022-02-20 19:40:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2595 transitions. [2022-02-20 19:40:28,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:28,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:28,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:28,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:40:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2594 transitions. [2022-02-20 19:40:28,708 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2594 transitions. Word has length 41 [2022-02-20 19:40:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:28,708 INFO L470 AbstractCegarLoop]: Abstraction has 1595 states and 2594 transitions. [2022-02-20 19:40:28,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2594 transitions. [2022-02-20 19:40:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:28,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:28,710 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] [2022-02-20 19:40:28,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:40:28,711 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash -360939040, now seen corresponding path program 1 times [2022-02-20 19:40:28,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:28,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762034483] [2022-02-20 19:40:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:28,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {20958#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {20958#true} is VALID [2022-02-20 19:40:28,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {20958#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {20958#true} is VALID [2022-02-20 19:40:28,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {20958#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20958#true} is VALID [2022-02-20 19:40:28,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {20958#true} assume 0 == ~r1~0 % 256; {20958#true} is VALID [2022-02-20 19:40:28,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {20958#true} assume ~id1~0 >= 0; {20958#true} is VALID [2022-02-20 19:40:28,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {20958#true} assume 0 == ~st1~0; {20958#true} is VALID [2022-02-20 19:40:28,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {20958#true} assume ~send1~0 == ~id1~0; {20958#true} is VALID [2022-02-20 19:40:28,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {20958#true} assume 0 == ~mode1~0 % 256; {20958#true} is VALID [2022-02-20 19:40:28,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {20958#true} assume ~id2~0 >= 0; {20958#true} is VALID [2022-02-20 19:40:28,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {20958#true} assume 0 == ~st2~0; {20958#true} is VALID [2022-02-20 19:40:28,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {20958#true} assume ~send2~0 == ~id2~0; {20958#true} is VALID [2022-02-20 19:40:28,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {20958#true} assume 0 == ~mode2~0 % 256; {20958#true} is VALID [2022-02-20 19:40:28,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {20958#true} assume ~id3~0 >= 0; {20958#true} is VALID [2022-02-20 19:40:28,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {20958#true} assume 0 == ~st3~0; {20958#true} is VALID [2022-02-20 19:40:28,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {20958#true} assume ~send3~0 == ~id3~0; {20958#true} is VALID [2022-02-20 19:40:28,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {20958#true} assume 0 == ~mode3~0 % 256; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {20960#(= (+ (* (- 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;main1_~i2~0#1 := 0; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {20960#(= (+ (* (- 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; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {20960#(= (+ (* (- 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; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {20960#(= (+ (* (- 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; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {20960#(= (+ (* (- 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; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {20960#(= (+ (* (- 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; {20960#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:28,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {20960#(= (+ (* (- 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; {20959#false} is VALID [2022-02-20 19:40:28,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {20959#false} assume !(node3_~m3~0#1 != ~nomsg~0); {20959#false} is VALID [2022-02-20 19:40:28,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {20959#false} ~mode3~0 := 0; {20959#false} is VALID [2022-02-20 19:40:28,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {20959#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {20959#false} is VALID [2022-02-20 19:40:28,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {20959#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {20959#false} is VALID [2022-02-20 19:40:28,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {20959#false} check_#res#1 := check_~tmp~1#1; {20959#false} is VALID [2022-02-20 19:40:28,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {20959#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {20959#false} is VALID [2022-02-20 19:40:28,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {20959#false} assume 0 == assert_~arg#1 % 256; {20959#false} is VALID [2022-02-20 19:40:28,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {20959#false} assume !false; {20959#false} is VALID [2022-02-20 19:40:28,830 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:40:28,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:28,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762034483] [2022-02-20 19:40:28,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762034483] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:28,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:28,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:28,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043258471] [2022-02-20 19:40:28,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:28,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:28,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:28,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:28,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:28,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:28,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:28,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:28,855 INFO L87 Difference]: Start difference. First operand 1595 states and 2594 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:30,605 INFO L93 Difference]: Finished difference Result 1719 states and 2786 transitions. [2022-02-20 19:40:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:30,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:30,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1628 transitions. [2022-02-20 19:40:31,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:32,079 INFO L225 Difference]: With dead ends: 1719 [2022-02-20 19:40:32,079 INFO L226 Difference]: Without dead ends: 1651 [2022-02-20 19:40:32,080 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:40:32,081 INFO L933 BasicCegarLoop]: 1544 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1609 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:40:32,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 1609 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2022-02-20 19:40:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2022-02-20 19:40:32,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:32,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1651 states. Second operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have 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:40:32,120 INFO L74 IsIncluded]: Start isIncluded. First operand 1651 states. Second operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have 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:40:32,122 INFO L87 Difference]: Start difference. First operand 1651 states. Second operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have 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:40:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:32,208 INFO L93 Difference]: Finished difference Result 1651 states and 2678 transitions. [2022-02-20 19:40:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2678 transitions. [2022-02-20 19:40:32,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:32,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:32,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 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 1651 states. [2022-02-20 19:40:32,215 INFO L87 Difference]: Start difference. First operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 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 1651 states. [2022-02-20 19:40:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:32,296 INFO L93 Difference]: Finished difference Result 1651 states and 2678 transitions. [2022-02-20 19:40:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2678 transitions. [2022-02-20 19:40:32,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:32,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:32,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:32,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have 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:40:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2677 transitions. [2022-02-20 19:40:32,388 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2677 transitions. Word has length 41 [2022-02-20 19:40:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:32,388 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2677 transitions. [2022-02-20 19:40:32,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2677 transitions. [2022-02-20 19:40:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:32,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:32,389 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] [2022-02-20 19:40:32,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:40:32,389 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash 857046358, now seen corresponding path program 1 times [2022-02-20 19:40:32,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:32,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583721425] [2022-02-20 19:40:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:32,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {27715#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {27715#true} is VALID [2022-02-20 19:40:32,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {27715#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {27715#true} is VALID [2022-02-20 19:40:32,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {27715#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {27715#true} is VALID [2022-02-20 19:40:32,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {27715#true} assume 0 == ~r1~0 % 256; {27715#true} is VALID [2022-02-20 19:40:32,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {27715#true} assume ~id1~0 >= 0; {27715#true} is VALID [2022-02-20 19:40:32,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {27715#true} assume 0 == ~st1~0; {27717#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:32,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {27717#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {27717#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:32,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {27717#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {27717#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:32,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {27717#(<= ~st1~0 0)} assume ~id2~0 >= 0; {27717#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:32,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {27717#(<= ~st1~0 0)} assume 0 == ~st2~0; {27718#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {27718#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {27718#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {27718#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {27718#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {27718#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {27718#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {27718#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {27719#(<= (+ ~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;main1_~i2~0#1 := 0; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {27719#(<= (+ ~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; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {27719#(<= (+ ~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; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {27719#(<= (+ ~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; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {27719#(<= (+ ~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; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {27719#(<= (+ ~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; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {27719#(<= (+ ~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; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:32,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {27719#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {27716#false} is VALID [2022-02-20 19:40:32,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {27716#false} check_#res#1 := check_~tmp~1#1; {27716#false} is VALID [2022-02-20 19:40:32,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {27716#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {27716#false} is VALID [2022-02-20 19:40:32,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {27716#false} assume 0 == assert_~arg#1 % 256; {27716#false} is VALID [2022-02-20 19:40:32,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {27716#false} assume !false; {27716#false} is VALID [2022-02-20 19:40:32,473 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:40:32,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:32,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583721425] [2022-02-20 19:40:32,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583721425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:32,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:32,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:32,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403689086] [2022-02-20 19:40:32,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:32,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:32,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:32,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:32,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:32,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:32,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:32,504 INFO L87 Difference]: Start difference. First operand 1649 states and 2677 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:35,056 INFO L93 Difference]: Finished difference Result 2381 states and 3811 transitions. [2022-02-20 19:40:35,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:40:35,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1874 transitions. [2022-02-20 19:40:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1874 transitions. [2022-02-20 19:40:35,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1874 transitions. [2022-02-20 19:40:36,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1874 edges. 1874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:36,689 INFO L225 Difference]: With dead ends: 2381 [2022-02-20 19:40:36,689 INFO L226 Difference]: Without dead ends: 2259 [2022-02-20 19:40:36,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:36,692 INFO L933 BasicCegarLoop]: 1516 mSDtfsCounter, 4693 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:36,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4693 Valid, 1934 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2022-02-20 19:40:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1769. [2022-02-20 19:40:36,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:36,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2259 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have 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:40:36,808 INFO L74 IsIncluded]: Start isIncluded. First operand 2259 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have 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:40:36,810 INFO L87 Difference]: Start difference. First operand 2259 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have 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:40:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:36,972 INFO L93 Difference]: Finished difference Result 2259 states and 3598 transitions. [2022-02-20 19:40:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3598 transitions. [2022-02-20 19:40:36,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:36,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:36,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 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 2259 states. [2022-02-20 19:40:36,980 INFO L87 Difference]: Start difference. First operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 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 2259 states. [2022-02-20 19:40:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:37,124 INFO L93 Difference]: Finished difference Result 2259 states and 3598 transitions. [2022-02-20 19:40:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3598 transitions. [2022-02-20 19:40:37,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:37,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:37,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:37,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have 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:40:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2857 transitions. [2022-02-20 19:40:37,229 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2857 transitions. Word has length 41 [2022-02-20 19:40:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:37,231 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 2857 transitions. [2022-02-20 19:40:37,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2857 transitions. [2022-02-20 19:40:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:37,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:37,231 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] [2022-02-20 19:40:37,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:40:37,232 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1867096070, now seen corresponding path program 1 times [2022-02-20 19:40:37,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:37,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528303079] [2022-02-20 19:40:37,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:37,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:37,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {36635#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {36635#true} is VALID [2022-02-20 19:40:37,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {36635#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {36635#true} is VALID [2022-02-20 19:40:37,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {36635#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36635#true} is VALID [2022-02-20 19:40:37,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {36635#true} assume 0 == ~r1~0 % 256; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {36637#(<= ~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;main1_~i2~0#1 := 0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {36637#(<= ~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; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {36637#(<= ~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; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {36637#(<= ~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; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {36637#(<= ~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; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {36637#(<= ~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; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {36637#(<= ~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; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:37,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {36637#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {36636#false} is VALID [2022-02-20 19:40:37,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {36636#false} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {36636#false} is VALID [2022-02-20 19:40:37,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {36636#false} check_#res#1 := check_~tmp~1#1; {36636#false} is VALID [2022-02-20 19:40:37,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {36636#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {36636#false} is VALID [2022-02-20 19:40:37,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {36636#false} assume 0 == assert_~arg#1 % 256; {36636#false} is VALID [2022-02-20 19:40:37,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {36636#false} assume !false; {36636#false} is VALID [2022-02-20 19:40:37,325 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:40:37,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:37,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528303079] [2022-02-20 19:40:37,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528303079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:37,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:37,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:37,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104859620] [2022-02-20 19:40:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:37,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:37,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:37,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:37,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:37,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:37,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:37,356 INFO L87 Difference]: Start difference. First operand 1769 states and 2857 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:38,959 INFO L93 Difference]: Finished difference Result 2209 states and 3519 transitions. [2022-02-20 19:40:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:38,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:38,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2022-02-20 19:40:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2022-02-20 19:40:38,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1629 transitions. [2022-02-20 19:40:40,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1629 edges. 1629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:40,426 INFO L225 Difference]: With dead ends: 2209 [2022-02-20 19:40:40,426 INFO L226 Difference]: Without dead ends: 1967 [2022-02-20 19:40:40,427 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:40:40,428 INFO L933 BasicCegarLoop]: 1517 mSDtfsCounter, 1471 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:40,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1471 Valid, 1569 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2022-02-20 19:40:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1957. [2022-02-20 19:40:40,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:40,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1967 states. Second operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have 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:40:40,628 INFO L74 IsIncluded]: Start isIncluded. First operand 1967 states. Second operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have 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:40:40,629 INFO L87 Difference]: Start difference. First operand 1967 states. Second operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have 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:40:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:40,751 INFO L93 Difference]: Finished difference Result 1967 states and 3130 transitions. [2022-02-20 19:40:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3130 transitions. [2022-02-20 19:40:40,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:40,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:40,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 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 1967 states. [2022-02-20 19:40:40,756 INFO L87 Difference]: Start difference. First operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 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 1967 states. [2022-02-20 19:40:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:40,865 INFO L93 Difference]: Finished difference Result 1967 states and 3130 transitions. [2022-02-20 19:40:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3130 transitions. [2022-02-20 19:40:40,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:40,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:40,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:40,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have 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:40:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3121 transitions. [2022-02-20 19:40:40,988 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3121 transitions. Word has length 43 [2022-02-20 19:40:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:40,988 INFO L470 AbstractCegarLoop]: Abstraction has 1957 states and 3121 transitions. [2022-02-20 19:40:40,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3121 transitions. [2022-02-20 19:40:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:40,988 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:40,988 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] [2022-02-20 19:40:40,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:40:40,989 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:40,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1933589582, now seen corresponding path program 1 times [2022-02-20 19:40:40,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:40,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175370135] [2022-02-20 19:40:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:41,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {44994#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {44994#true} is VALID [2022-02-20 19:40:41,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {44994#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {44994#true} is VALID [2022-02-20 19:40:41,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {44994#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {44994#true} is VALID [2022-02-20 19:40:41,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {44994#true} assume 0 == ~r1~0 % 256; {44994#true} is VALID [2022-02-20 19:40:41,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {44994#true} assume ~id1~0 >= 0; {44994#true} is VALID [2022-02-20 19:40:41,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {44994#true} assume 0 == ~st1~0; {44996#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:41,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {44996#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {44996#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:41,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {44996#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {44996#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:41,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {44996#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {44996#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:41,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {44996#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {44997#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:41,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {44997#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {44997#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:41,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {44997#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {44997#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:41,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {44997#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {44997#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:41,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {44997#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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;main1_~i2~0#1 := 0; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:41,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {44998#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {44995#false} is VALID [2022-02-20 19:40:41,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {44995#false} check_#res#1 := check_~tmp~1#1; {44995#false} is VALID [2022-02-20 19:40:41,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {44995#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {44995#false} is VALID [2022-02-20 19:40:41,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {44995#false} assume 0 == assert_~arg#1 % 256; {44995#false} is VALID [2022-02-20 19:40:41,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {44995#false} assume !false; {44995#false} is VALID [2022-02-20 19:40:41,102 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:40:41,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:41,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175370135] [2022-02-20 19:40:41,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175370135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:41,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:41,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:41,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146505516] [2022-02-20 19:40:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:41,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:41,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:41,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:41,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:41,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:41,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:41,134 INFO L87 Difference]: Start difference. First operand 1957 states and 3121 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:43,236 INFO L93 Difference]: Finished difference Result 2389 states and 3755 transitions. [2022-02-20 19:40:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:43,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2022-02-20 19:40:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2022-02-20 19:40:43,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1636 transitions. [2022-02-20 19:40:44,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1636 edges. 1636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:44,677 INFO L225 Difference]: With dead ends: 2389 [2022-02-20 19:40:44,677 INFO L226 Difference]: Without dead ends: 1959 [2022-02-20 19:40:44,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:40:44,678 INFO L933 BasicCegarLoop]: 1515 mSDtfsCounter, 1531 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:44,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1531 Valid, 1680 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2022-02-20 19:40:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1957. [2022-02-20 19:40:44,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:44,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1959 states. Second operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have 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:40:44,913 INFO L74 IsIncluded]: Start isIncluded. First operand 1959 states. Second operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have 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:40:44,914 INFO L87 Difference]: Start difference. First operand 1959 states. Second operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have 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:40:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:45,023 INFO L93 Difference]: Finished difference Result 1959 states and 3114 transitions. [2022-02-20 19:40:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3114 transitions. [2022-02-20 19:40:45,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:45,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:45,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 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 1959 states. [2022-02-20 19:40:45,027 INFO L87 Difference]: Start difference. First operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 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 1959 states. [2022-02-20 19:40:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:45,142 INFO L93 Difference]: Finished difference Result 1959 states and 3114 transitions. [2022-02-20 19:40:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3114 transitions. [2022-02-20 19:40:45,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:45,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:45,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:45,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have 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:40:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3113 transitions. [2022-02-20 19:40:45,292 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3113 transitions. Word has length 43 [2022-02-20 19:40:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:45,293 INFO L470 AbstractCegarLoop]: Abstraction has 1957 states and 3113 transitions. [2022-02-20 19:40:45,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3113 transitions. [2022-02-20 19:40:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:40:45,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:45,294 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] [2022-02-20 19:40:45,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:40:45,294 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -602988295, now seen corresponding path program 1 times [2022-02-20 19:40:45,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:45,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967820270] [2022-02-20 19:40:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:45,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {53565#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {53565#true} is VALID [2022-02-20 19:40:45,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {53565#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {53565#true} is VALID [2022-02-20 19:40:45,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {53565#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {53565#true} is VALID [2022-02-20 19:40:45,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {53565#true} assume 0 == ~r1~0 % 256; {53565#true} is VALID [2022-02-20 19:40:45,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {53565#true} assume ~id1~0 >= 0; {53565#true} is VALID [2022-02-20 19:40:45,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {53565#true} assume 0 == ~st1~0; {53565#true} is VALID [2022-02-20 19:40:45,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {53565#true} assume ~send1~0 == ~id1~0; {53565#true} is VALID [2022-02-20 19:40:45,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {53565#true} assume 0 == ~mode1~0 % 256; {53565#true} is VALID [2022-02-20 19:40:45,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {53565#true} assume ~id2~0 >= 0; {53565#true} is VALID [2022-02-20 19:40:45,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {53565#true} assume 0 == ~st2~0; {53565#true} is VALID [2022-02-20 19:40:45,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {53565#true} assume ~send2~0 == ~id2~0; {53565#true} is VALID [2022-02-20 19:40:45,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {53565#true} assume 0 == ~mode2~0 % 256; {53565#true} is VALID [2022-02-20 19:40:45,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {53565#true} assume ~id3~0 >= 0; {53565#true} is VALID [2022-02-20 19:40:45,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {53565#true} assume 0 == ~st3~0; {53565#true} is VALID [2022-02-20 19:40:45,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {53565#true} assume ~send3~0 == ~id3~0; {53565#true} is VALID [2022-02-20 19:40:45,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {53565#true} assume 0 == ~mode3~0 % 256; {53565#true} is VALID [2022-02-20 19:40:45,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {53565#true} assume ~id1~0 != ~id2~0; {53565#true} is VALID [2022-02-20 19:40:45,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {53565#true} assume ~id1~0 != ~id3~0; {53565#true} is VALID [2022-02-20 19:40:45,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {53565#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {53567#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:40:45,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {53567#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {53568#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:40:45,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {53568#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {53569#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:40:45,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {53569#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {53565#true} is VALID [2022-02-20 19:40:45,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {53565#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {53565#true} is VALID [2022-02-20 19:40:45,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {53565#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {53565#true} is VALID [2022-02-20 19:40:45,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {53565#true} assume !(0 != ~mode1~0 % 256); {53565#true} is VALID [2022-02-20 19:40:45,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {53565#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {53565#true} is VALID [2022-02-20 19:40:45,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {53565#true} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {53565#true} is VALID [2022-02-20 19:40:45,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {53565#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {53565#true} is VALID [2022-02-20 19:40:45,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {53565#true} assume !(0 != ~mode2~0 % 256); {53565#true} is VALID [2022-02-20 19:40:45,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {53565#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {53565#true} is VALID [2022-02-20 19:40:45,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {53565#true} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {53565#true} is VALID [2022-02-20 19:40:45,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {53565#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {53565#true} is VALID [2022-02-20 19:40:45,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {53565#true} assume !(0 != ~mode3~0 % 256); {53565#true} is VALID [2022-02-20 19:40:45,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {53565#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {53565#true} is VALID [2022-02-20 19:40:45,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {53565#true} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {53565#true} is VALID [2022-02-20 19:40:45,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {53565#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {53565#true} is VALID [2022-02-20 19:40:45,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {53565#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {53565#true} is VALID [2022-02-20 19:40:45,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {53565#true} assume !(~r1~0 % 256 >= 3); {53565#true} is VALID [2022-02-20 19:40:45,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {53565#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {53565#true} is VALID [2022-02-20 19:40:45,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {53565#true} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {53570#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:40:45,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {53570#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {53571#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:40:45,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {53571#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {53572#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:40:45,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {53572#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {53566#false} is VALID [2022-02-20 19:40:45,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {53566#false} assume !false; {53566#false} is VALID [2022-02-20 19:40:45,392 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:40:45,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:45,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967820270] [2022-02-20 19:40:45,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967820270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:45,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:45,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:40:45,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857781651] [2022-02-20 19:40:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:45,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:40:45,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:45,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:45,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:45,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:40:45,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:40:45,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:45,421 INFO L87 Difference]: Start difference. First operand 1957 states and 3113 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:52,533 INFO L93 Difference]: Finished difference Result 2291 states and 3585 transitions. [2022-02-20 19:40:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:40:52,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:40:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1583 transitions. [2022-02-20 19:40:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1583 transitions. [2022-02-20 19:40:52,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1583 transitions. [2022-02-20 19:40:53,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1583 edges. 1583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:53,817 INFO L225 Difference]: With dead ends: 2291 [2022-02-20 19:40:53,817 INFO L226 Difference]: Without dead ends: 2289 [2022-02-20 19:40:53,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:40:53,819 INFO L933 BasicCegarLoop]: 1552 mSDtfsCounter, 396 mSDsluCounter, 8921 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 10473 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:53,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 10473 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2022-02-20 19:40:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1981. [2022-02-20 19:40:54,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:54,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2289 states. Second operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:40:54,152 INFO L74 IsIncluded]: Start isIncluded. First operand 2289 states. Second operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:40:54,153 INFO L87 Difference]: Start difference. First operand 2289 states. Second operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:40:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:54,296 INFO L93 Difference]: Finished difference Result 2289 states and 3572 transitions. [2022-02-20 19:40:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3572 transitions. [2022-02-20 19:40:54,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:54,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:54,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 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 2289 states. [2022-02-20 19:40:54,301 INFO L87 Difference]: Start difference. First operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 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 2289 states. [2022-02-20 19:40:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:54,446 INFO L93 Difference]: Finished difference Result 2289 states and 3572 transitions. [2022-02-20 19:40:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3572 transitions. [2022-02-20 19:40:54,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:54,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:54,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:54,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:40:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3133 transitions. [2022-02-20 19:40:54,568 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3133 transitions. Word has length 44 [2022-02-20 19:40:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:54,569 INFO L470 AbstractCegarLoop]: Abstraction has 1981 states and 3133 transitions. [2022-02-20 19:40:54,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3133 transitions. [2022-02-20 19:40:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:40:54,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:54,569 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] [2022-02-20 19:40:54,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:40:54,570 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1900121563, now seen corresponding path program 1 times [2022-02-20 19:40:54,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:54,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733298963] [2022-02-20 19:40:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:54,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {62740#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {62740#true} is VALID [2022-02-20 19:40:54,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {62740#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {62740#true} is VALID [2022-02-20 19:40:54,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {62740#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {62740#true} is VALID [2022-02-20 19:40:54,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {62740#true} assume 0 == ~r1~0 % 256; {62740#true} is VALID [2022-02-20 19:40:54,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {62740#true} assume ~id1~0 >= 0; {62740#true} is VALID [2022-02-20 19:40:54,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {62740#true} assume 0 == ~st1~0; {62740#true} is VALID [2022-02-20 19:40:54,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {62740#true} assume ~send1~0 == ~id1~0; {62740#true} is VALID [2022-02-20 19:40:54,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {62740#true} assume 0 == ~mode1~0 % 256; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {62742#(= (+ (* (- 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;main1_~i2~0#1 := 0; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {62742#(= (+ (* (- 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; {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:54,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {62742#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {62741#false} is VALID [2022-02-20 19:40:54,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {62741#false} assume !(255 == ~r1~0 % 256); {62741#false} is VALID [2022-02-20 19:40:54,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {62741#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {62741#false} is VALID [2022-02-20 19:40:54,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {62741#false} assume node1_~m1~0#1 != ~nomsg~0; {62741#false} is VALID [2022-02-20 19:40:54,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {62741#false} assume !(node1_~m1~0#1 > ~id1~0); {62741#false} is VALID [2022-02-20 19:40:54,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {62741#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {62741#false} is VALID [2022-02-20 19:40:54,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {62741#false} ~mode1~0 := 0; {62741#false} is VALID [2022-02-20 19:40:54,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {62741#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; {62741#false} is VALID [2022-02-20 19:40:54,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {62741#false} assume !(0 != ~mode2~0 % 256); {62741#false} is VALID [2022-02-20 19:40:54,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {62741#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {62741#false} is VALID [2022-02-20 19:40:54,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {62741#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {62741#false} is VALID [2022-02-20 19:40:54,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {62741#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; {62741#false} is VALID [2022-02-20 19:40:54,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {62741#false} assume !(0 != ~mode3~0 % 256); {62741#false} is VALID [2022-02-20 19:40:54,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {62741#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {62741#false} is VALID [2022-02-20 19:40:54,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {62741#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {62741#false} is VALID [2022-02-20 19:40:54,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {62741#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {62741#false} is VALID [2022-02-20 19:40:54,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {62741#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {62741#false} is VALID [2022-02-20 19:40:54,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {62741#false} check_#res#1 := check_~tmp~1#1; {62741#false} is VALID [2022-02-20 19:40:54,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {62741#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {62741#false} is VALID [2022-02-20 19:40:54,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {62741#false} assume 0 == assert_~arg#1 % 256; {62741#false} is VALID [2022-02-20 19:40:54,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {62741#false} assume !false; {62741#false} is VALID [2022-02-20 19:40:54,609 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:40:54,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:54,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733298963] [2022-02-20 19:40:54,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733298963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:54,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:54,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:54,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165755110] [2022-02-20 19:40:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 19:40:54,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:54,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:54,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:54,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:54,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:54,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:54,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:54,636 INFO L87 Difference]: Start difference. First operand 1981 states and 3133 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:56,832 INFO L93 Difference]: Finished difference Result 2452 states and 3811 transitions. [2022-02-20 19:40:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 19:40:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1625 transitions. [2022-02-20 19:40:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1625 transitions. [2022-02-20 19:40:56,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1625 transitions. [2022-02-20 19:40:58,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1625 edges. 1625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:58,385 INFO L225 Difference]: With dead ends: 2452 [2022-02-20 19:40:58,386 INFO L226 Difference]: Without dead ends: 2185 [2022-02-20 19:40:58,386 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:40:58,388 INFO L933 BasicCegarLoop]: 1558 mSDtfsCounter, 1485 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1615 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:40:58,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1615 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-02-20 19:40:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2183. [2022-02-20 19:40:58,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:58,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2185 states. Second operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have 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:40:58,829 INFO L74 IsIncluded]: Start isIncluded. First operand 2185 states. Second operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have 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:40:58,830 INFO L87 Difference]: Start difference. First operand 2185 states. Second operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have 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:40:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:58,972 INFO L93 Difference]: Finished difference Result 2185 states and 3412 transitions. [2022-02-20 19:40:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3412 transitions. [2022-02-20 19:40:58,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:58,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:58,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 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 2185 states. [2022-02-20 19:40:58,977 INFO L87 Difference]: Start difference. First operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 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 2185 states. [2022-02-20 19:40:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:59,113 INFO L93 Difference]: Finished difference Result 2185 states and 3412 transitions. [2022-02-20 19:40:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3412 transitions. [2022-02-20 19:40:59,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:59,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:59,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:59,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have 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:40:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3411 transitions. [2022-02-20 19:40:59,284 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3411 transitions. Word has length 45 [2022-02-20 19:40:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:59,285 INFO L470 AbstractCegarLoop]: Abstraction has 2183 states and 3411 transitions. [2022-02-20 19:40:59,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3411 transitions. [2022-02-20 19:40:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:59,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:59,285 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:40:59,286 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash -393288849, now seen corresponding path program 1 times [2022-02-20 19:40:59,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:59,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706612567] [2022-02-20 19:40:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:59,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:59,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {72142#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {72142#true} is VALID [2022-02-20 19:40:59,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {72142#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {72142#true} is VALID [2022-02-20 19:40:59,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {72142#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {72142#true} is VALID [2022-02-20 19:40:59,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {72142#true} assume 0 == ~r1~0 % 256; {72142#true} is VALID [2022-02-20 19:40:59,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {72142#true} assume ~id1~0 >= 0; {72142#true} is VALID [2022-02-20 19:40:59,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {72142#true} assume 0 == ~st1~0; {72144#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:59,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {72144#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {72144#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:59,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {72144#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {72144#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:59,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {72144#(<= ~st1~0 0)} assume ~id2~0 >= 0; {72144#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:59,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {72144#(<= ~st1~0 0)} assume 0 == ~st2~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {72145#(<= (+ ~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;main1_~i2~0#1 := 0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {72145#(<= (+ ~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; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,381 INFO L290 TraceCheckUtils]: 53: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {72145#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:59,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {72145#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {72146#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:59,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {72146#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {72146#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:59,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {72146#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {72146#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:59,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {72146#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {72143#false} is VALID [2022-02-20 19:40:59,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {72143#false} check_#res#1 := check_~tmp~1#1; {72143#false} is VALID [2022-02-20 19:40:59,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {72143#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {72143#false} is VALID [2022-02-20 19:40:59,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {72143#false} assume 0 == assert_~arg#1 % 256; {72143#false} is VALID [2022-02-20 19:40:59,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {72143#false} assume !false; {72143#false} is VALID [2022-02-20 19:40:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 19:40:59,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:59,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706612567] [2022-02-20 19:40:59,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706612567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:59,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:59,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:59,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684117281] [2022-02-20 19:40:59,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:59,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:40:59,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:59,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:59,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:59,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:59,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:59,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:59,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:59,418 INFO L87 Difference]: Start difference. First operand 2183 states and 3411 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)