./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.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.8.ufo.BOUNDED-16.pals+Problem12_label08.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 8d6ab270424ffa2caaf27b7ac8ad862ff93b45999f126eddc180d440bd9f4c92 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:52:50,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:52:50,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:52:50,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:52:50,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:52:50,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:52:50,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:52:50,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:52:50,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:52:50,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:52:50,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:52:50,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:52:50,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:52:50,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:52:50,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:52:50,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:52:50,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:52:50,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:52:50,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:52:50,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:52:50,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:52:50,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:52:50,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:52:50,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:52:50,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:52:50,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:52:50,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:52:50,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:52:50,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:52:50,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:52:50,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:52:50,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:52:50,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:52:50,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:52:50,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:52:50,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:52:50,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:52:50,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:52:50,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:52:50,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:52:50,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:52:50,293 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:52:50,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:52:50,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:52:50,326 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:52:50,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:52:50,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:52:50,327 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:52:50,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:52:50,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:52:50,328 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:52:50,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:52:50,329 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:52:50,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:52:50,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:52:50,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:52:50,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:52:50,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:52:50,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:52:50,330 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:52:50,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:52:50,331 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:52:50,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:52:50,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:52:50,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:52:50,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:52:50,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:50,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:52:50,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:52:50,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:52:50,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:52:50,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:52:50,333 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:52:50,333 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:52:50,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:52:50,333 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 -> 8d6ab270424ffa2caaf27b7ac8ad862ff93b45999f126eddc180d440bd9f4c92 [2022-02-20 19:52:50,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:52:50,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:52:50,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:52:50,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:52:50,562 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:52:50,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c [2022-02-20 19:52:50,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af5b0034/b13d078f70c14b8aa4a8be563448550e/FLAG48157ad29 [2022-02-20 19:52:51,131 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:52:51,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c [2022-02-20 19:52:51,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af5b0034/b13d078f70c14b8aa4a8be563448550e/FLAG48157ad29 [2022-02-20 19:52:51,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af5b0034/b13d078f70c14b8aa4a8be563448550e [2022-02-20 19:52:51,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:52:51,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:52:51,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:51,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:52:51,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:52:51,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:51" (1/1) ... [2022-02-20 19:52:51,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a56a867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:51, skipping insertion in model container [2022-02-20 19:52:51,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:51" (1/1) ... [2022-02-20 19:52:51,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:52:51,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:52:51,716 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.8.ufo.BOUNDED-16.pals+Problem12_label08.c[26860,26873] [2022-02-20 19:52:51,770 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.8.ufo.BOUNDED-16.pals+Problem12_label08.c[30367,30380] [2022-02-20 19:52:52,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:52:52,273 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:52:52,320 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.8.ufo.BOUNDED-16.pals+Problem12_label08.c[26860,26873] [2022-02-20 19:52:52,329 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.8.ufo.BOUNDED-16.pals+Problem12_label08.c[30367,30380] [2022-02-20 19:52:52,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:52:52,642 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:52:52,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52 WrapperNode [2022-02-20 19:52:52,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:52,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:52:52,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:52:52,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:52:52,648 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:52:52" (1/1) ... [2022-02-20 19:52:52,689 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:52:52" (1/1) ... [2022-02-20 19:52:53,061 INFO L137 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5281 [2022-02-20 19:52:53,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:52:53,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:52:53,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:52:53,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:52:53,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (1/1) ... [2022-02-20 19:52:53,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (1/1) ... [2022-02-20 19:52:53,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (1/1) ... [2022-02-20 19:52:53,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (1/1) ... [2022-02-20 19:52:53,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (1/1) ... [2022-02-20 19:52:53,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (1/1) ... [2022-02-20 19:52:53,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (1/1) ... [2022-02-20 19:52:53,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:52:53,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:52:53,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:52:53,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:52:53,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (1/1) ... [2022-02-20 19:52:53,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:53,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:52:53,465 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:52:53,538 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:52:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:52:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:52:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:52:53,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:52:53,732 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:52:53,741 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:53:00,380 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:53:00,396 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:53:00,396 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:53:00,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:00 BoogieIcfgContainer [2022-02-20 19:53:00,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:53:00,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:53:00,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:53:00,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:53:00,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:52:51" (1/3) ... [2022-02-20 19:53:00,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37baaf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:00, skipping insertion in model container [2022-02-20 19:53:00,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:52" (2/3) ... [2022-02-20 19:53:00,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37baaf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:00, skipping insertion in model container [2022-02-20 19:53:00,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:00" (3/3) ... [2022-02-20 19:53:00,406 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c [2022-02-20 19:53:00,410 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:53:00,411 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:53:00,454 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:53:00,465 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:53:00,465 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:53:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have 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:53:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:53:00,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:00,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:00,496 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:00,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1701875667, now seen corresponding path program 1 times [2022-02-20 19:53:00,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:00,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103876081] [2022-02-20 19:53:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:00,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#(<= 13 ~a7~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#(<= 13 ~a7~0)} assume !(0 != main_#t~nondet63#1);havoc main_#t~nondet63#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet61#1, main2_#t~ret62#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#(<= 13 ~a7~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,758 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#(<= 13 ~a7~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~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#(<= 13 ~a7~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {968#(<= 13 ~a7~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {968#(<= 13 ~a7~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {968#(<= 13 ~a7~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {968#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {968#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= 13 ~a7~0)} is VALID [2022-02-20 19:53:00,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {968#(<= 13 ~a7~0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {967#false} is VALID [2022-02-20 19:53:00,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 19:53:00,774 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:53:00,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:00,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103876081] [2022-02-20 19:53:00,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103876081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:00,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:00,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:00,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336228381] [2022-02-20 19:53:00,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:53:00,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:00,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:00,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:00,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:00,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:00,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:00,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:00,834 INFO L87 Difference]: Start difference. First operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 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 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:06,552 INFO L93 Difference]: Finished difference Result 2614 states and 5014 transitions. [2022-02-20 19:53:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:06,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:53:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5014 transitions. [2022-02-20 19:53:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5014 transitions. [2022-02-20 19:53:06,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5014 transitions. [2022-02-20 19:53:10,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5014 edges. 5014 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:10,719 INFO L225 Difference]: With dead ends: 2614 [2022-02-20 19:53:10,719 INFO L226 Difference]: Without dead ends: 1648 [2022-02-20 19:53:10,726 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:53:10,729 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 1059 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:10,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1059 Valid, 366 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-02-20 19:53:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-02-20 19:53:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2022-02-20 19:53:10,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:10,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.8572296476306196) internal successors, (3057), 1647 states have internal predecessors, (3057), 0 states have call successors, (0), 0 states have 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:53:10,833 INFO L74 IsIncluded]: Start isIncluded. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.8572296476306196) internal successors, (3057), 1647 states have internal predecessors, (3057), 0 states have call successors, (0), 0 states have 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:53:10,835 INFO L87 Difference]: Start difference. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.8572296476306196) internal successors, (3057), 1647 states have internal predecessors, (3057), 0 states have call successors, (0), 0 states have 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:53:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:10,936 INFO L93 Difference]: Finished difference Result 1648 states and 3057 transitions. [2022-02-20 19:53:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 3057 transitions. [2022-02-20 19:53:10,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:10,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:10,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1646 states have (on average 1.8572296476306196) internal successors, (3057), 1647 states have internal predecessors, (3057), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:53:10,952 INFO L87 Difference]: Start difference. First operand has 1648 states, 1646 states have (on average 1.8572296476306196) internal successors, (3057), 1647 states have internal predecessors, (3057), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:53:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:11,051 INFO L93 Difference]: Finished difference Result 1648 states and 3057 transitions. [2022-02-20 19:53:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 3057 transitions. [2022-02-20 19:53:11,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:11,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:11,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:11,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1646 states have (on average 1.8572296476306196) internal successors, (3057), 1647 states have internal predecessors, (3057), 0 states have call successors, (0), 0 states have 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:53:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 3057 transitions. [2022-02-20 19:53:11,152 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 3057 transitions. Word has length 30 [2022-02-20 19:53:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:11,157 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 3057 transitions. [2022-02-20 19:53:11,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 3057 transitions. [2022-02-20 19:53:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:11,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:11,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:11,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:53:11,159 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 815979124, now seen corresponding path program 1 times [2022-02-20 19:53:11,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:11,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053883448] [2022-02-20 19:53:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:11,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {8594#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {8594#true} is VALID [2022-02-20 19:53:11,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {8594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {8594#true} is VALID [2022-02-20 19:53:11,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {8594#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8594#true} is VALID [2022-02-20 19:53:11,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {8594#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8596#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:53:11,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {8596#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8597#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:53:11,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {8597#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {8598#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:53:11,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {8598#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8595#false} is VALID [2022-02-20 19:53:11,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {8595#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8595#false} is VALID [2022-02-20 19:53:11,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {8595#false} assume !!(main1_~i2~0#1 < 16);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; {8595#false} is VALID [2022-02-20 19:53:11,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {8595#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {8595#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8595#false} is VALID [2022-02-20 19:53:11,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {8595#false} ~mode1~0 := 0; {8595#false} is VALID [2022-02-20 19:53:11,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {8595#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; {8595#false} is VALID [2022-02-20 19:53:11,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {8595#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {8595#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8595#false} is VALID [2022-02-20 19:53:11,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {8595#false} ~mode2~0 := 0; {8595#false} is VALID [2022-02-20 19:53:11,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {8595#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; {8595#false} is VALID [2022-02-20 19:53:11,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {8595#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {8595#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8595#false} is VALID [2022-02-20 19:53:11,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {8595#false} ~mode3~0 := 0; {8595#false} is VALID [2022-02-20 19:53:11,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {8595#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {8595#false} assume !(0 != ~mode4~0 % 256); {8595#false} is VALID [2022-02-20 19:53:11,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {8595#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8595#false} is VALID [2022-02-20 19:53:11,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {8595#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8595#false} is VALID [2022-02-20 19:53:11,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {8595#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {8595#false} assume !(0 != ~mode5~0 % 256); {8595#false} is VALID [2022-02-20 19:53:11,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {8595#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {8595#false} is VALID [2022-02-20 19:53:11,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {8595#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {8595#false} is VALID [2022-02-20 19:53:11,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {8595#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {8595#false} assume !(0 != ~mode6~0 % 256); {8595#false} is VALID [2022-02-20 19:53:11,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {8595#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {8595#false} is VALID [2022-02-20 19:53:11,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {8595#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {8595#false} is VALID [2022-02-20 19:53:11,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {8595#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {8595#false} assume !(0 != ~mode7~0 % 256); {8595#false} is VALID [2022-02-20 19:53:11,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {8595#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {8595#false} is VALID [2022-02-20 19:53:11,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {8595#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {8595#false} is VALID [2022-02-20 19:53:11,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {8595#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {8595#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {8595#false} is VALID [2022-02-20 19:53:11,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {8595#false} assume !(node8_~m8~0#1 != ~nomsg~0); {8595#false} is VALID [2022-02-20 19:53:11,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {8595#false} ~mode8~0 := 0; {8595#false} is VALID [2022-02-20 19:53:11,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {8595#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8595#false} is VALID [2022-02-20 19:53:11,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {8595#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {8595#false} is VALID [2022-02-20 19:53:11,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {8595#false} check_#res#1 := check_~tmp~1#1; {8595#false} is VALID [2022-02-20 19:53:11,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {8595#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {8595#false} is VALID [2022-02-20 19:53:11,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {8595#false} assume 0 == assert_~arg#1 % 256; {8595#false} is VALID [2022-02-20 19:53:11,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {8595#false} assume !false; {8595#false} is VALID [2022-02-20 19:53:11,298 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:53:11,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:11,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053883448] [2022-02-20 19:53:11,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053883448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:11,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:11,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:53:11,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453295279] [2022-02-20 19:53:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:11,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:11,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:11,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:11,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:11,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:53:11,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:53:11,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:11,330 INFO L87 Difference]: Start difference. First operand 1648 states and 3057 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:15,415 INFO L93 Difference]: Finished difference Result 1728 states and 3182 transitions. [2022-02-20 19:53:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:53:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:53:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:53:15,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1813 transitions. [2022-02-20 19:53:16,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1813 edges. 1813 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:16,881 INFO L225 Difference]: With dead ends: 1728 [2022-02-20 19:53:16,882 INFO L226 Difference]: Without dead ends: 1648 [2022-02-20 19:53:16,882 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:53:16,883 INFO L933 BasicCegarLoop]: 1686 mSDtfsCounter, 3 mSDsluCounter, 4994 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6680 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:16,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6680 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-02-20 19:53:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2022-02-20 19:53:16,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:16,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.8201701093560145) internal successors, (2996), 1647 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have 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:53:16,913 INFO L74 IsIncluded]: Start isIncluded. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.8201701093560145) internal successors, (2996), 1647 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have 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:53:16,915 INFO L87 Difference]: Start difference. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.8201701093560145) internal successors, (2996), 1647 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have 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:53:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:17,005 INFO L93 Difference]: Finished difference Result 1648 states and 2996 transitions. [2022-02-20 19:53:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2996 transitions. [2022-02-20 19:53:17,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:17,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:17,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1646 states have (on average 1.8201701093560145) internal successors, (2996), 1647 states have internal predecessors, (2996), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:53:17,014 INFO L87 Difference]: Start difference. First operand has 1648 states, 1646 states have (on average 1.8201701093560145) internal successors, (2996), 1647 states have internal predecessors, (2996), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:53:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:17,111 INFO L93 Difference]: Finished difference Result 1648 states and 2996 transitions. [2022-02-20 19:53:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2996 transitions. [2022-02-20 19:53:17,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:17,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:17,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:17,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1646 states have (on average 1.8201701093560145) internal successors, (2996), 1647 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have 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:53:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2996 transitions. [2022-02-20 19:53:17,206 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2996 transitions. Word has length 46 [2022-02-20 19:53:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:17,209 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2996 transitions. [2022-02-20 19:53:17,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2996 transitions. [2022-02-20 19:53:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 19:53:17,211 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:17,212 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-02-20 19:53:17,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:53:17,212 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1580122138, now seen corresponding path program 1 times [2022-02-20 19:53:17,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:17,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521299617] [2022-02-20 19:53:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:17,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {15333#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet63#1);havoc main_#t~nondet63#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet61#1, main2_#t~ret62#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 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~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:17,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {15335#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,431 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15336#(not (= (+ (- 14) ~a24~0) 0))} is VALID [2022-02-20 19:53:17,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {15336#(not (= (+ (- 14) ~a24~0) 0))} assume (((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0;~a17~0 := -15873 + (-11 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109) - 547674) - -563482;~a7~0 := 12;calculate_output_#res#1 := -1; {15334#false} is VALID [2022-02-20 19:53:17,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {15334#false} main2_#t~ret62#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret62#1 && main2_#t~ret62#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret62#1;havoc main2_#t~ret62#1; {15334#false} is VALID [2022-02-20 19:53:17,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {15334#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {15334#false} is VALID [2022-02-20 19:53:17,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {15334#false} 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~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15334#false} is VALID [2022-02-20 19:53:17,438 INFO L290 TraceCheckUtils]: 70: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,438 INFO L290 TraceCheckUtils]: 71: Hoare triple {15334#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,438 INFO L290 TraceCheckUtils]: 72: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,438 INFO L290 TraceCheckUtils]: 73: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,438 INFO L290 TraceCheckUtils]: 74: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,438 INFO L290 TraceCheckUtils]: 75: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,438 INFO L290 TraceCheckUtils]: 76: Hoare triple {15334#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,439 INFO L290 TraceCheckUtils]: 77: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,439 INFO L290 TraceCheckUtils]: 78: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,439 INFO L290 TraceCheckUtils]: 79: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,439 INFO L290 TraceCheckUtils]: 80: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,439 INFO L290 TraceCheckUtils]: 81: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,439 INFO L290 TraceCheckUtils]: 82: Hoare triple {15334#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,439 INFO L290 TraceCheckUtils]: 83: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,440 INFO L290 TraceCheckUtils]: 84: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,440 INFO L290 TraceCheckUtils]: 85: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,440 INFO L290 TraceCheckUtils]: 86: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,440 INFO L290 TraceCheckUtils]: 87: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,441 INFO L290 TraceCheckUtils]: 88: Hoare triple {15334#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,441 INFO L290 TraceCheckUtils]: 89: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,441 INFO L290 TraceCheckUtils]: 90: Hoare triple {15334#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,441 INFO L290 TraceCheckUtils]: 91: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,441 INFO L290 TraceCheckUtils]: 92: Hoare triple {15334#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15334#false} is VALID [2022-02-20 19:53:17,442 INFO L290 TraceCheckUtils]: 93: Hoare triple {15334#false} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {15334#false} is VALID [2022-02-20 19:53:17,442 INFO L290 TraceCheckUtils]: 94: Hoare triple {15334#false} assume !false; {15334#false} is VALID [2022-02-20 19:53:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:17,443 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:17,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521299617] [2022-02-20 19:53:17,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521299617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:17,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:17,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:17,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020254326] [2022-02-20 19:53:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:17,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 19:53:17,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:17,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:17,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:17,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:53:17,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:17,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:53:17,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:53:17,503 INFO L87 Difference]: Start difference. First operand 1648 states and 2996 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:27,362 INFO L93 Difference]: Finished difference Result 5413 states and 9984 transitions. [2022-02-20 19:53:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:53:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 19:53:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5877 transitions. [2022-02-20 19:53:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5877 transitions. [2022-02-20 19:53:27,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 5877 transitions. [2022-02-20 19:53:31,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5877 edges. 5877 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:31,573 INFO L225 Difference]: With dead ends: 5413 [2022-02-20 19:53:31,574 INFO L226 Difference]: Without dead ends: 3909 [2022-02-20 19:53:31,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:31,578 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 2682 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 5146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1534 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:31,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2682 Valid, 385 Invalid, 5146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1534 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-02-20 19:53:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3909 states. [2022-02-20 19:53:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3909 to 3901. [2022-02-20 19:53:31,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:31,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3909 states. Second operand has 3901 states, 3899 states have (on average 1.5957937932803283) internal successors, (6222), 3900 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have 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:53:31,680 INFO L74 IsIncluded]: Start isIncluded. First operand 3909 states. Second operand has 3901 states, 3899 states have (on average 1.5957937932803283) internal successors, (6222), 3900 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have 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:53:31,685 INFO L87 Difference]: Start difference. First operand 3909 states. Second operand has 3901 states, 3899 states have (on average 1.5957937932803283) internal successors, (6222), 3900 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have 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:53:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:32,192 INFO L93 Difference]: Finished difference Result 3909 states and 6230 transitions. [2022-02-20 19:53:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 6230 transitions. [2022-02-20 19:53:32,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:32,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:32,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 3901 states, 3899 states have (on average 1.5957937932803283) internal successors, (6222), 3900 states have internal predecessors, (6222), 0 states have call successors, (0), 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 3909 states. [2022-02-20 19:53:32,209 INFO L87 Difference]: Start difference. First operand has 3901 states, 3899 states have (on average 1.5957937932803283) internal successors, (6222), 3900 states have internal predecessors, (6222), 0 states have call successors, (0), 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 3909 states. [2022-02-20 19:53:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:32,669 INFO L93 Difference]: Finished difference Result 3909 states and 6230 transitions. [2022-02-20 19:53:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 6230 transitions. [2022-02-20 19:53:32,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:32,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:32,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:32,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3901 states, 3899 states have (on average 1.5957937932803283) internal successors, (6222), 3900 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have 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:53:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 6222 transitions. [2022-02-20 19:53:33,201 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 6222 transitions. Word has length 95 [2022-02-20 19:53:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:33,202 INFO L470 AbstractCegarLoop]: Abstraction has 3901 states and 6222 transitions. [2022-02-20 19:53:33,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:53:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6222 transitions. [2022-02-20 19:53:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 19:53:33,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:33,204 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-02-20 19:53:33,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:53:33,205 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:33,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:33,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1618571541, now seen corresponding path program 1 times [2022-02-20 19:53:33,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:33,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830377218] [2022-02-20 19:53:33,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:33,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:33,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {32559#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet63#1);havoc main_#t~nondet63#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet61#1, main2_#t~ret62#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {32561#(<= (+ ~a17~0 124) 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~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,429 INFO L290 TraceCheckUtils]: 59: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,433 INFO L290 TraceCheckUtils]: 70: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,433 INFO L290 TraceCheckUtils]: 71: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume 4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0;~a7~0 := 12;~a24~0 := 13;~a5~0 := 3;calculate_output_#res#1 := -1; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,434 INFO L290 TraceCheckUtils]: 73: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} main2_#t~ret62#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret62#1 && main2_#t~ret62#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret62#1;havoc main2_#t~ret62#1; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,434 INFO L290 TraceCheckUtils]: 75: Hoare triple {32561#(<= (+ ~a17~0 124) 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~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,438 INFO L290 TraceCheckUtils]: 78: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,440 INFO L290 TraceCheckUtils]: 79: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,444 INFO L290 TraceCheckUtils]: 80: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,447 INFO L290 TraceCheckUtils]: 83: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,450 INFO L290 TraceCheckUtils]: 86: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,450 INFO L290 TraceCheckUtils]: 87: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,450 INFO L290 TraceCheckUtils]: 88: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,451 INFO L290 TraceCheckUtils]: 90: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,451 INFO L290 TraceCheckUtils]: 91: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,451 INFO L290 TraceCheckUtils]: 92: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,453 INFO L290 TraceCheckUtils]: 96: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,453 INFO L290 TraceCheckUtils]: 97: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,453 INFO L290 TraceCheckUtils]: 98: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {32561#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:33,454 INFO L290 TraceCheckUtils]: 99: Hoare triple {32561#(<= (+ ~a17~0 124) 0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {32560#false} is VALID [2022-02-20 19:53:33,454 INFO L290 TraceCheckUtils]: 100: Hoare triple {32560#false} assume !false; {32560#false} is VALID [2022-02-20 19:53:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 19:53:33,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:33,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830377218] [2022-02-20 19:53:33,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830377218] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:33,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:33,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:33,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948248079] [2022-02-20 19:53:33,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 19:53:33,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:33,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:33,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:33,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:33,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:33,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:33,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:33,516 INFO L87 Difference]: Start difference. First operand 3901 states and 6222 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:42,289 INFO L93 Difference]: Finished difference Result 10662 states and 17528 transitions. [2022-02-20 19:53:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 19:53:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4500 transitions. [2022-02-20 19:53:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4500 transitions. [2022-02-20 19:53:42,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4500 transitions. [2022-02-20 19:53:45,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4500 edges. 4500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:47,493 INFO L225 Difference]: With dead ends: 10662 [2022-02-20 19:53:47,493 INFO L226 Difference]: Without dead ends: 6905 [2022-02-20 19:53:47,496 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:53:47,497 INFO L933 BasicCegarLoop]: 703 mSDtfsCounter, 913 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:47,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 710 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:53:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6905 states. [2022-02-20 19:53:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6905 to 6905. [2022-02-20 19:53:47,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:47,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6905 states. Second operand has 6905 states, 6903 states have (on average 1.4477763291322614) internal successors, (9994), 6904 states have internal predecessors, (9994), 0 states have call successors, (0), 0 states have 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:53:47,626 INFO L74 IsIncluded]: Start isIncluded. First operand 6905 states. Second operand has 6905 states, 6903 states have (on average 1.4477763291322614) internal successors, (9994), 6904 states have internal predecessors, (9994), 0 states have call successors, (0), 0 states have 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:53:47,634 INFO L87 Difference]: Start difference. First operand 6905 states. Second operand has 6905 states, 6903 states have (on average 1.4477763291322614) internal successors, (9994), 6904 states have internal predecessors, (9994), 0 states have call successors, (0), 0 states have 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:53:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:49,125 INFO L93 Difference]: Finished difference Result 6905 states and 9994 transitions. [2022-02-20 19:53:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6905 states and 9994 transitions. [2022-02-20 19:53:49,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:49,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:49,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 6905 states, 6903 states have (on average 1.4477763291322614) internal successors, (9994), 6904 states have internal predecessors, (9994), 0 states have call successors, (0), 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 6905 states. [2022-02-20 19:53:49,146 INFO L87 Difference]: Start difference. First operand has 6905 states, 6903 states have (on average 1.4477763291322614) internal successors, (9994), 6904 states have internal predecessors, (9994), 0 states have call successors, (0), 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 6905 states. [2022-02-20 19:53:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:50,537 INFO L93 Difference]: Finished difference Result 6905 states and 9994 transitions. [2022-02-20 19:53:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 6905 states and 9994 transitions. [2022-02-20 19:53:50,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:50,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:50,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:50,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6905 states, 6903 states have (on average 1.4477763291322614) internal successors, (9994), 6904 states have internal predecessors, (9994), 0 states have call successors, (0), 0 states have 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:53:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6905 states to 6905 states and 9994 transitions. [2022-02-20 19:53:52,326 INFO L78 Accepts]: Start accepts. Automaton has 6905 states and 9994 transitions. Word has length 101 [2022-02-20 19:53:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:52,326 INFO L470 AbstractCegarLoop]: Abstraction has 6905 states and 9994 transitions. [2022-02-20 19:53:52,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6905 states and 9994 transitions. [2022-02-20 19:53:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:52,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:52,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:52,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:53:52,329 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1090783836, now seen corresponding path program 1 times [2022-02-20 19:53:52,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:52,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168206592] [2022-02-20 19:53:52,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:52,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:52,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {64080#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {64080#true} is VALID [2022-02-20 19:53:52,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {64080#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {64080#true} is VALID [2022-02-20 19:53:52,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {64080#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64080#true} is VALID [2022-02-20 19:53:52,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {64080#true} assume 0 == ~r1~0; {64080#true} is VALID [2022-02-20 19:53:52,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {64080#true} assume ~id1~0 >= 0; {64080#true} is VALID [2022-02-20 19:53:52,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {64080#true} assume 0 == ~st1~0; {64080#true} is VALID [2022-02-20 19:53:52,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {64080#true} assume ~send1~0 == ~id1~0; {64080#true} is VALID [2022-02-20 19:53:52,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {64080#true} assume 0 == ~mode1~0 % 256; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,423 INFO L290 TraceCheckUtils]: 59: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,426 INFO L290 TraceCheckUtils]: 68: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 16);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; {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:52,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {64082#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {64081#false} assume !(node1_~m1~0#1 != ~nomsg~0); {64081#false} is VALID [2022-02-20 19:53:52,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {64081#false} ~mode1~0 := 0; {64081#false} is VALID [2022-02-20 19:53:52,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {64081#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; {64081#false} is VALID [2022-02-20 19:53:52,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {64081#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,431 INFO L290 TraceCheckUtils]: 74: Hoare triple {64081#false} assume !(node2_~m2~0#1 != ~nomsg~0); {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {64081#false} ~mode2~0 := 0; {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {64081#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; {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {64081#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {64081#false} assume !(node3_~m3~0#1 != ~nomsg~0); {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 79: Hoare triple {64081#false} ~mode3~0 := 0; {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 80: Hoare triple {64081#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 81: Hoare triple {64081#false} assume !(0 != ~mode4~0 % 256); {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 82: Hoare triple {64081#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 83: Hoare triple {64081#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {64081#false} is VALID [2022-02-20 19:53:52,432 INFO L290 TraceCheckUtils]: 84: Hoare triple {64081#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 85: Hoare triple {64081#false} assume !(0 != ~mode5~0 % 256); {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {64081#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 87: Hoare triple {64081#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 88: Hoare triple {64081#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 89: Hoare triple {64081#false} assume !(0 != ~mode6~0 % 256); {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 90: Hoare triple {64081#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 91: Hoare triple {64081#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 92: Hoare triple {64081#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,433 INFO L290 TraceCheckUtils]: 93: Hoare triple {64081#false} assume !(0 != ~mode7~0 % 256); {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 94: Hoare triple {64081#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 95: Hoare triple {64081#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 96: Hoare triple {64081#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 97: Hoare triple {64081#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 98: Hoare triple {64081#false} assume !(node8_~m8~0#1 != ~nomsg~0); {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 99: Hoare triple {64081#false} ~mode8~0 := 0; {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 100: Hoare triple {64081#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 101: Hoare triple {64081#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {64081#false} is VALID [2022-02-20 19:53:52,434 INFO L290 TraceCheckUtils]: 102: Hoare triple {64081#false} check_#res#1 := check_~tmp~1#1; {64081#false} is VALID [2022-02-20 19:53:52,435 INFO L290 TraceCheckUtils]: 103: Hoare triple {64081#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {64081#false} is VALID [2022-02-20 19:53:52,437 INFO L290 TraceCheckUtils]: 104: Hoare triple {64081#false} assume 0 == assert_~arg#1 % 256; {64081#false} is VALID [2022-02-20 19:53:52,438 INFO L290 TraceCheckUtils]: 105: Hoare triple {64081#false} assume !false; {64081#false} is VALID [2022-02-20 19:53:52,438 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:53:52,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:52,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168206592] [2022-02-20 19:53:52,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168206592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:52,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:52,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:52,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103255679] [2022-02-20 19:53:52,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:52,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:52,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:52,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:52,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:52,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:52,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:52,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:52,532 INFO L87 Difference]: Start difference. First operand 6905 states and 9994 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:56,112 INFO L93 Difference]: Finished difference Result 7051 states and 10226 transitions. [2022-02-20 19:53:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:56,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:56,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:53:57,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.