./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label03.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_label03.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 3736b39782d33d69e49d45bc83c966fe9403fa4c46d3557706bbbfc10e7a8136 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:52:24,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:52:24,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:52:24,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:52:24,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:52:24,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:52:24,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:52:24,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:52:24,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:52:24,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:52:24,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:52:24,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:52:24,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:52:24,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:52:24,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:52:24,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:52:24,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:52:24,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:52:24,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:52:24,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:52:24,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:52:24,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:52:24,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:52:24,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:52:24,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:52:24,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:52:24,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:52:24,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:52:24,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:52:24,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:52:24,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:52:24,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:52:24,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:52:24,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:52:24,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:52:24,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:52:24,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:52:24,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:52:24,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:52:24,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:52:24,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:52:24,848 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:24,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:52:24,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:52:24,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:52:24,872 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:52:24,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:52:24,872 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:52:24,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:52:24,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:52:24,873 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:52:24,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:52:24,874 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:52:24,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:52:24,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:52:24,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:52:24,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:52:24,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:52:24,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:52:24,875 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:52:24,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:52:24,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:52:24,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:52:24,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:52:24,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:52:24,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:52:24,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:24,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:52:24,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:52:24,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:52:24,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:52:24,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:52:24,878 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:52:24,878 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:52:24,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:52:24,878 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 -> 3736b39782d33d69e49d45bc83c966fe9403fa4c46d3557706bbbfc10e7a8136 [2022-02-20 19:52:25,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:52:25,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:52:25,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:52:25,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:52:25,116 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:52:25,116 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_label03.c [2022-02-20 19:52:25,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a7ddbfb/af986d47ac0545d0a71e552601fde056/FLAGf461b9588 [2022-02-20 19:52:25,807 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:52:25,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label03.c [2022-02-20 19:52:25,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a7ddbfb/af986d47ac0545d0a71e552601fde056/FLAGf461b9588 [2022-02-20 19:52:26,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a7ddbfb/af986d47ac0545d0a71e552601fde056 [2022-02-20 19:52:26,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:52:26,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:52:26,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:26,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:52:26,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:52:26,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:26" (1/1) ... [2022-02-20 19:52:26,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@906481b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:26, skipping insertion in model container [2022-02-20 19:52:26,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:26" (1/1) ... [2022-02-20 19:52:26,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:52:26,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:52:26,503 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_label03.c[26860,26873] [2022-02-20 19:52:26,519 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_label03.c[29197,29210] [2022-02-20 19:52:27,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:52:27,042 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:52:27,090 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_label03.c[26860,26873] [2022-02-20 19:52:27,100 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_label03.c[29197,29210] [2022-02-20 19:52:27,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:52:27,420 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:52:27,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:27 WrapperNode [2022-02-20 19:52:27,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:27,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:52:27,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:52:27,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:52:27,426 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:27" (1/1) ... [2022-02-20 19:52:27,494 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:27" (1/1) ... [2022-02-20 19:52:27,927 INFO L137 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5281 [2022-02-20 19:52:27,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:52:27,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:52:27,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:52:27,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:52:27,934 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:27" (1/1) ... [2022-02-20 19:52:27,935 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:27" (1/1) ... [2022-02-20 19:52:28,030 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:27" (1/1) ... [2022-02-20 19:52:28,031 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:27" (1/1) ... [2022-02-20 19:52:28,172 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:27" (1/1) ... [2022-02-20 19:52:28,196 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:27" (1/1) ... [2022-02-20 19:52:28,235 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:27" (1/1) ... [2022-02-20 19:52:28,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:52:28,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:52:28,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:52:28,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:52:28,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:27" (1/1) ... [2022-02-20 19:52:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:52:28,339 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:28,357 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:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:52:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:52:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:52:28,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:52:28,494 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:52:28,495 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:52:34,958 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:52:34,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:52:34,970 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:52:34,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:52:34 BoogieIcfgContainer [2022-02-20 19:52:34,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:52:34,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:52:34,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:52:34,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:52:34,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:52:26" (1/3) ... [2022-02-20 19:52:34,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b02a300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:52:34, skipping insertion in model container [2022-02-20 19:52:34,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:27" (2/3) ... [2022-02-20 19:52:34,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b02a300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:52:34, skipping insertion in model container [2022-02-20 19:52:34,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:52:34" (3/3) ... [2022-02-20 19:52:34,981 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label03.c [2022-02-20 19:52:34,985 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:52:34,985 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:52:35,022 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:52:35,026 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:52:35,026 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:52:35,061 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:52:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 19:52:35,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:35,066 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] [2022-02-20 19:52:35,067 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash 193046949, now seen corresponding path program 1 times [2022-02-20 19:52:35,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:35,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953173353] [2022-02-20 19:52:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:35,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:35,361 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#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#(<= (+ ~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; {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#(<= (+ ~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; {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#(<= (+ ~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; {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#(<= (+ ~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; {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {968#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:52:35,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {968#(<= (+ ~a17~0 124) 0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {967#false} is VALID [2022-02-20 19:52:35,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 19:52:35,375 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:52:35,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:35,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953173353] [2022-02-20 19:52:35,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953173353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:35,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:35,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:52:35,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611555533] [2022-02-20 19:52:35,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:35,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 19:52:35,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:35,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:52:35,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:35,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:52:35,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:35,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:52:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:52:35,431 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 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:52:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:41,214 INFO L93 Difference]: Finished difference Result 2630 states and 5030 transitions. [2022-02-20 19:52:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:52:41,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 19:52:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:52:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5030 transitions. [2022-02-20 19:52:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:52:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5030 transitions. [2022-02-20 19:52:41,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5030 transitions. [2022-02-20 19:52:44,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5030 edges. 5030 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:45,051 INFO L225 Difference]: With dead ends: 2630 [2022-02-20 19:52:45,052 INFO L226 Difference]: Without dead ends: 1648 [2022-02-20 19:52:45,059 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:52:45,062 INFO L933 BasicCegarLoop]: 768 mSDtfsCounter, 1053 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:52:45,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 779 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:52:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-02-20 19:52:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2022-02-20 19:52:45,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:45,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.620291616038882) internal successors, (2667), 1647 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have 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:52:45,150 INFO L74 IsIncluded]: Start isIncluded. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.620291616038882) internal successors, (2667), 1647 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have 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:52:45,153 INFO L87 Difference]: Start difference. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.620291616038882) internal successors, (2667), 1647 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have 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:52:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:45,237 INFO L93 Difference]: Finished difference Result 1648 states and 2667 transitions. [2022-02-20 19:52:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2667 transitions. [2022-02-20 19:52:45,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:45,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:45,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1646 states have (on average 1.620291616038882) internal successors, (2667), 1647 states have internal predecessors, (2667), 0 states have call successors, (0), 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:52:45,248 INFO L87 Difference]: Start difference. First operand has 1648 states, 1646 states have (on average 1.620291616038882) internal successors, (2667), 1647 states have internal predecessors, (2667), 0 states have call successors, (0), 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:52:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:45,334 INFO L93 Difference]: Finished difference Result 1648 states and 2667 transitions. [2022-02-20 19:52:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2667 transitions. [2022-02-20 19:52:45,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:45,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:45,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:45,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1646 states have (on average 1.620291616038882) internal successors, (2667), 1647 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have 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:52:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2667 transitions. [2022-02-20 19:52:45,427 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2667 transitions. Word has length 20 [2022-02-20 19:52:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:45,427 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2667 transitions. [2022-02-20 19:52:45,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:52:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2667 transitions. [2022-02-20 19:52:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:52:45,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:45,429 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:52:45,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:52:45,430 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:45,433 INFO L85 PathProgramCache]: Analyzing trace with hash 815979124, now seen corresponding path program 1 times [2022-02-20 19:52:45,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:45,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065659223] [2022-02-20 19:52:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:45,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {8610#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; {8610#true} is VALID [2022-02-20 19:52:45,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {8610#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; {8610#true} is VALID [2022-02-20 19:52:45,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {8610#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; {8610#true} is VALID [2022-02-20 19:52:45,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {8610#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8612#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:52:45,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {8612#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8613#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:52:45,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {8613#(= |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; {8614#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:52:45,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {8614#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8611#false} is VALID [2022-02-20 19:52:45,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {8611#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8611#false} is VALID [2022-02-20 19:52:45,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {8611#false} ~mode1~0 := 0; {8611#false} is VALID [2022-02-20 19:52:45,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {8611#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8611#false} is VALID [2022-02-20 19:52:45,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {8611#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8611#false} is VALID [2022-02-20 19:52:45,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {8611#false} ~mode2~0 := 0; {8611#false} is VALID [2022-02-20 19:52:45,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {8611#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8611#false} is VALID [2022-02-20 19:52:45,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {8611#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8611#false} is VALID [2022-02-20 19:52:45,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {8611#false} ~mode3~0 := 0; {8611#false} is VALID [2022-02-20 19:52:45,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {8611#false} assume !(0 != ~mode4~0 % 256); {8611#false} is VALID [2022-02-20 19:52:45,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {8611#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8611#false} is VALID [2022-02-20 19:52:45,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {8611#false} assume !(0 != ~mode5~0 % 256); {8611#false} is VALID [2022-02-20 19:52:45,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {8611#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {8611#false} is VALID [2022-02-20 19:52:45,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {8611#false} assume !(0 != ~mode6~0 % 256); {8611#false} is VALID [2022-02-20 19:52:45,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {8611#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {8611#false} is VALID [2022-02-20 19:52:45,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {8611#false} assume !(0 != ~mode7~0 % 256); {8611#false} is VALID [2022-02-20 19:52:45,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {8611#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {8611#false} is VALID [2022-02-20 19:52:45,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {8611#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {8611#false} is VALID [2022-02-20 19:52:45,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {8611#false} assume !(node8_~m8~0#1 != ~nomsg~0); {8611#false} is VALID [2022-02-20 19:52:45,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {8611#false} ~mode8~0 := 0; {8611#false} is VALID [2022-02-20 19:52:45,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {8611#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {8611#false} is VALID [2022-02-20 19:52:45,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {8611#false} check_#res#1 := check_~tmp~1#1; {8611#false} is VALID [2022-02-20 19:52:45,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {8611#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; {8611#false} is VALID [2022-02-20 19:52:45,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {8611#false} assume 0 == assert_~arg#1 % 256; {8611#false} is VALID [2022-02-20 19:52:45,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {8611#false} assume !false; {8611#false} is VALID [2022-02-20 19:52:45,581 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:52:45,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:45,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065659223] [2022-02-20 19:52:45,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065659223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:45,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:45,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:52:45,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41214709] [2022-02-20 19:52:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:45,584 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:52:45,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:45,585 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:52:45,610 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:52:45,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:52:45,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:45,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:52:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:52:45,613 INFO L87 Difference]: Start difference. First operand 1648 states and 2667 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:52:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:49,552 INFO L93 Difference]: Finished difference Result 1728 states and 2792 transitions. [2022-02-20 19:52:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:52:49,552 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:52:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:49,553 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:52:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:52:49,559 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:52:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:52:49,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1813 transitions. [2022-02-20 19:52:50,789 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:52:50,873 INFO L225 Difference]: With dead ends: 1728 [2022-02-20 19:52:50,873 INFO L226 Difference]: Without dead ends: 1648 [2022-02-20 19:52:50,874 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:52:50,874 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:52:50,875 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:52:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-02-20 19:52:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2022-02-20 19:52:50,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:50,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have 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:52:50,904 INFO L74 IsIncluded]: Start isIncluded. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have 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:52:50,907 INFO L87 Difference]: Start difference. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have 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:52:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:50,991 INFO L93 Difference]: Finished difference Result 1648 states and 2606 transitions. [2022-02-20 19:52:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2606 transitions. [2022-02-20 19:52:50,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:50,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:50,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 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:52:50,999 INFO L87 Difference]: Start difference. First operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 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:52:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:51,078 INFO L93 Difference]: Finished difference Result 1648 states and 2606 transitions. [2022-02-20 19:52:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2606 transitions. [2022-02-20 19:52:51,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:51,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:51,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:51,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have 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:52:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2606 transitions. [2022-02-20 19:52:51,170 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2606 transitions. Word has length 46 [2022-02-20 19:52:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:51,170 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2606 transitions. [2022-02-20 19:52:51,170 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:52:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2606 transitions. [2022-02-20 19:52:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 19:52:51,173 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:51,174 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:52:51,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:52:51,174 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash -786269897, now seen corresponding path program 1 times [2022-02-20 19:52:51,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:51,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123881605] [2022-02-20 19:52:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:51,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {15349#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; {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {15351#(<= ~a5~0 4)} 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; {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {15351#(<= ~a5~0 4)} 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; {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {15351#(<= ~a5~0 4)} 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; {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {15351#(<= ~a5~0 4)} 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; {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {15351#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {15351#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {15351#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {15351#(<= ~a5~0 4)} 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); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {15351#(<= ~a5~0 4)} 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); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {15351#(<= ~a5~0 4)} 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); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {15351#(<= ~a5~0 4)} 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); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,381 INFO L290 TraceCheckUtils]: 70: Hoare triple {15351#(<= ~a5~0 4)} 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); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {15351#(<= ~a5~0 4)} 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); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {15351#(<= ~a5~0 4)} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {15351#(<= ~a5~0 4)} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {15351#(<= ~a5~0 4)} assume !(4 == ~a5~0 && (189 < ~a2~0 && 281 >= ~a2~0) && 14 == ~a24~0 && (((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || (12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) && 4 == calculate_output_~input#1); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {15351#(<= ~a5~0 4)} assume !(((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0); {15351#(<= ~a5~0 4)} is VALID [2022-02-20 19:52:51,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {15351#(<= ~a5~0 4)} assume (~a17~0 <= -108 && (189 < ~a2~0 && 281 >= ~a2~0) && ((14 == ~a7~0 || 12 == ~a7~0 || 13 == ~a7~0) && 1 == calculate_output_~input#1) && 15 == ~a24~0) && 5 == ~a5~0;~a17~0 := (if 5 * (16 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109)) < 0 && 0 != 5 * (16 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109)) % 109 then 5 * (16 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109)) % 109 - 109 else 5 * (16 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109)) % 109) - -2;~a7~0 := 14;~a24~0 := 13;calculate_output_#res#1 := -1; {15350#false} is VALID [2022-02-20 19:52:51,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {15350#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; {15350#false} is VALID [2022-02-20 19:52:51,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {15350#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; {15350#false} is VALID [2022-02-20 19:52:51,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {15350#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; {15350#false} is VALID [2022-02-20 19:52:51,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {15350#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {15350#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {15350#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {15350#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {15350#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {15350#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {15350#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {15350#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {15350#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,386 INFO L290 TraceCheckUtils]: 89: Hoare triple {15350#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,386 INFO L290 TraceCheckUtils]: 90: Hoare triple {15350#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {15350#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {15350#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15350#false} is VALID [2022-02-20 19:52:51,386 INFO L290 TraceCheckUtils]: 93: Hoare triple {15350#false} assume (((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {15350#false} is VALID [2022-02-20 19:52:51,386 INFO L290 TraceCheckUtils]: 94: Hoare triple {15350#false} assume !false; {15350#false} is VALID [2022-02-20 19:52:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:52:51,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:51,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123881605] [2022-02-20 19:52:51,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123881605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:51,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:51,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:52:51,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068962178] [2022-02-20 19:52:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:51,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 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:52:51,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:51,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 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:52:51,444 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:52:51,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:52:51,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:51,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:52:51,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:52:51,445 INFO L87 Difference]: Start difference. First operand 1648 states and 2606 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 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:52:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:56,287 INFO L93 Difference]: Finished difference Result 4654 states and 7437 transitions. [2022-02-20 19:52:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:52:56,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 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:52:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 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:52:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4500 transitions. [2022-02-20 19:52:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 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:52:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4500 transitions. [2022-02-20 19:52:56,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4500 transitions. [2022-02-20 19:52:59,410 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:52:59,710 INFO L225 Difference]: With dead ends: 4654 [2022-02-20 19:52:59,710 INFO L226 Difference]: Without dead ends: 3150 [2022-02-20 19:52:59,711 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:52:59,712 INFO L933 BasicCegarLoop]: 631 mSDtfsCounter, 961 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:52:59,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 637 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 19:52:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2022-02-20 19:52:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 3150. [2022-02-20 19:52:59,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:59,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3150 states. Second operand has 3150 states, 3148 states have (on average 1.412007623888183) internal successors, (4445), 3149 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have 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:52:59,774 INFO L74 IsIncluded]: Start isIncluded. First operand 3150 states. Second operand has 3150 states, 3148 states have (on average 1.412007623888183) internal successors, (4445), 3149 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have 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:52:59,777 INFO L87 Difference]: Start difference. First operand 3150 states. Second operand has 3150 states, 3148 states have (on average 1.412007623888183) internal successors, (4445), 3149 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have 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,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:00,073 INFO L93 Difference]: Finished difference Result 3150 states and 4445 transitions. [2022-02-20 19:53:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4445 transitions. [2022-02-20 19:53:00,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:00,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:00,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 3150 states, 3148 states have (on average 1.412007623888183) internal successors, (4445), 3149 states have internal predecessors, (4445), 0 states have call successors, (0), 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 3150 states. [2022-02-20 19:53:00,093 INFO L87 Difference]: Start difference. First operand has 3150 states, 3148 states have (on average 1.412007623888183) internal successors, (4445), 3149 states have internal predecessors, (4445), 0 states have call successors, (0), 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 3150 states. [2022-02-20 19:53:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:00,379 INFO L93 Difference]: Finished difference Result 3150 states and 4445 transitions. [2022-02-20 19:53:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4445 transitions. [2022-02-20 19:53:00,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:00,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:00,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:00,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 3148 states have (on average 1.412007623888183) internal successors, (4445), 3149 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have 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,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4445 transitions. [2022-02-20 19:53:00,690 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4445 transitions. Word has length 95 [2022-02-20 19:53:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:00,691 INFO L470 AbstractCegarLoop]: Abstraction has 3150 states and 4445 transitions. [2022-02-20 19:53:00,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 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:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4445 transitions. [2022-02-20 19:53:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 19:53:00,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:00,692 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:00,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:53:00,693 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash 202501084, now seen corresponding path program 1 times [2022-02-20 19:53:00,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:00,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623848141] [2022-02-20 19:53:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:00,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {29532#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; {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {29534#(<= ~a2~0 170)} 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; {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {29534#(<= ~a2~0 170)} 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; {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {29534#(<= ~a2~0 170)} 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; {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {29534#(<= ~a2~0 170)} 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; {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,851 INFO L290 TraceCheckUtils]: 58: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {29534#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {29534#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {29534#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {29534#(<= ~a2~0 170)} 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); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {29534#(<= ~a2~0 170)} 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); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {29534#(<= ~a2~0 170)} 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); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {29534#(<= ~a2~0 170)} 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); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {29534#(<= ~a2~0 170)} 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); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,855 INFO L290 TraceCheckUtils]: 71: Hoare triple {29534#(<= ~a2~0 170)} 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); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {29534#(<= ~a2~0 170)} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {29534#(<= ~a2~0 170)} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {29534#(<= ~a2~0 170)} assume !(4 == ~a5~0 && (189 < ~a2~0 && 281 >= ~a2~0) && 14 == ~a24~0 && (((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || (12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) && 4 == calculate_output_~input#1); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,861 INFO L290 TraceCheckUtils]: 75: Hoare triple {29534#(<= ~a2~0 170)} assume !(((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {29534#(<= ~a2~0 170)} assume !((~a17~0 <= -108 && (189 < ~a2~0 && 281 >= ~a2~0) && ((14 == ~a7~0 || 12 == ~a7~0 || 13 == ~a7~0) && 1 == calculate_output_~input#1) && 15 == ~a24~0) && 5 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {29534#(<= ~a2~0 170)} assume !((~a17~0 <= -108 && ((189 < ~a2~0 && 281 >= ~a2~0) && (12 == ~a7~0 || 13 == ~a7~0) && 5 == calculate_output_~input#1) && 13 == ~a24~0) && 6 == ~a5~0); {29534#(<= ~a2~0 170)} is VALID [2022-02-20 19:53:00,866 INFO L290 TraceCheckUtils]: 78: Hoare triple {29534#(<= ~a2~0 170)} assume (13 == ~a24~0 && ~a17~0 <= -108 && (4 == ~a5~0 && 2 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0) && 12 == ~a7~0;~a17~0 := (if (if (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) < 0 && 0 != (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) % 5 then 1 + (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5 else (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5) < 0 && 0 != (if (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) < 0 && 0 != (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) % 5 then 1 + (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5 else (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5) % 109 then (if (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) < 0 && 0 != (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) % 5 then 1 + (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5 else (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5) % 109 - 109 else (if (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) < 0 && 0 != (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) % 5 then 1 + (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5 else (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5) % 109) - -93;~a7~0 := 14;~a24~0 := 15;~a5~0 := 3;calculate_output_#res#1 := -1; {29533#false} is VALID [2022-02-20 19:53:00,866 INFO L290 TraceCheckUtils]: 79: Hoare triple {29533#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; {29533#false} is VALID [2022-02-20 19:53:00,867 INFO L290 TraceCheckUtils]: 80: Hoare triple {29533#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; {29533#false} is VALID [2022-02-20 19:53:00,867 INFO L290 TraceCheckUtils]: 81: Hoare triple {29533#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; {29533#false} is VALID [2022-02-20 19:53:00,867 INFO L290 TraceCheckUtils]: 82: Hoare triple {29533#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,868 INFO L290 TraceCheckUtils]: 83: Hoare triple {29533#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,868 INFO L290 TraceCheckUtils]: 84: Hoare triple {29533#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,868 INFO L290 TraceCheckUtils]: 85: Hoare triple {29533#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,868 INFO L290 TraceCheckUtils]: 86: Hoare triple {29533#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,868 INFO L290 TraceCheckUtils]: 87: Hoare triple {29533#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,868 INFO L290 TraceCheckUtils]: 88: Hoare triple {29533#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,868 INFO L290 TraceCheckUtils]: 89: Hoare triple {29533#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,869 INFO L290 TraceCheckUtils]: 90: Hoare triple {29533#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,869 INFO L290 TraceCheckUtils]: 91: Hoare triple {29533#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,869 INFO L290 TraceCheckUtils]: 92: Hoare triple {29533#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,869 INFO L290 TraceCheckUtils]: 93: Hoare triple {29533#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,871 INFO L290 TraceCheckUtils]: 94: Hoare triple {29533#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29533#false} is VALID [2022-02-20 19:53:00,872 INFO L290 TraceCheckUtils]: 95: Hoare triple {29533#false} assume (((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {29533#false} is VALID [2022-02-20 19:53:00,872 INFO L290 TraceCheckUtils]: 96: Hoare triple {29533#false} assume !false; {29533#false} is VALID [2022-02-20 19:53:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:00,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:00,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623848141] [2022-02-20 19:53:00,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623848141] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:00,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:00,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:00,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598873009] [2022-02-20 19:53:00,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:00,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 19:53:00,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:00,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:00,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:00,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:00,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:00,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:00,938 INFO L87 Difference]: Start difference. First operand 3150 states and 4445 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:07,695 INFO L93 Difference]: Finished difference Result 9162 states and 12955 transitions. [2022-02-20 19:53:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 19:53:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4501 transitions. [2022-02-20 19:53:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4501 transitions. [2022-02-20 19:53:07,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4501 transitions. [2022-02-20 19:53:10,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4501 edges. 4501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:12,086 INFO L225 Difference]: With dead ends: 9162 [2022-02-20 19:53:12,086 INFO L226 Difference]: Without dead ends: 6156 [2022-02-20 19:53:12,089 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:12,090 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 1101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:12,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1101 Valid, 540 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 19:53:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6156 states. [2022-02-20 19:53:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 6154. [2022-02-20 19:53:12,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:12,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6156 states. Second operand has 6154 states, 6152 states have (on average 1.296001300390117) internal successors, (7973), 6153 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have 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:12,205 INFO L74 IsIncluded]: Start isIncluded. First operand 6156 states. Second operand has 6154 states, 6152 states have (on average 1.296001300390117) internal successors, (7973), 6153 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have 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:12,212 INFO L87 Difference]: Start difference. First operand 6156 states. Second operand has 6154 states, 6152 states have (on average 1.296001300390117) internal successors, (7973), 6153 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have 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:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:13,323 INFO L93 Difference]: Finished difference Result 6156 states and 7974 transitions. [2022-02-20 19:53:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 6156 states and 7974 transitions. [2022-02-20 19:53:13,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:13,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:13,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 6154 states, 6152 states have (on average 1.296001300390117) internal successors, (7973), 6153 states have internal predecessors, (7973), 0 states have call successors, (0), 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 6156 states. [2022-02-20 19:53:13,342 INFO L87 Difference]: Start difference. First operand has 6154 states, 6152 states have (on average 1.296001300390117) internal successors, (7973), 6153 states have internal predecessors, (7973), 0 states have call successors, (0), 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 6156 states. [2022-02-20 19:53:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:14,411 INFO L93 Difference]: Finished difference Result 6156 states and 7974 transitions. [2022-02-20 19:53:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6156 states and 7974 transitions. [2022-02-20 19:53:14,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:14,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:14,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:14,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6154 states, 6152 states have (on average 1.296001300390117) internal successors, (7973), 6153 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have 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,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 7973 transitions. [2022-02-20 19:53:15,511 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 7973 transitions. Word has length 97 [2022-02-20 19:53:15,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:15,511 INFO L470 AbstractCegarLoop]: Abstraction has 6154 states and 7973 transitions. [2022-02-20 19:53:15,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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,512 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 7973 transitions. [2022-02-20 19:53:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:15,512 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:15,512 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:15,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:53:15,513 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:15,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1090783836, now seen corresponding path program 1 times [2022-02-20 19:53:15,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:15,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297803052] [2022-02-20 19:53:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:15,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {57289#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; {57289#true} is VALID [2022-02-20 19:53:15,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {57289#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; {57289#true} is VALID [2022-02-20 19:53:15,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {57289#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; {57289#true} is VALID [2022-02-20 19:53:15,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {57289#true} assume 0 == ~r1~0; {57289#true} is VALID [2022-02-20 19:53:15,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {57289#true} assume ~id1~0 >= 0; {57289#true} is VALID [2022-02-20 19:53:15,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {57289#true} assume 0 == ~st1~0; {57289#true} is VALID [2022-02-20 19:53:15,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {57289#true} assume ~send1~0 == ~id1~0; {57289#true} is VALID [2022-02-20 19:53:15,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {57289#true} assume 0 == ~mode1~0 % 256; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {57291#(= (+ (* (- 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; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {57291#(= (+ (* (- 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; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,603 INFO L290 TraceCheckUtils]: 68: Hoare triple {57291#(= (+ (* (- 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; {57291#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:15,603 INFO L290 TraceCheckUtils]: 69: Hoare triple {57291#(= (+ (* (- 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; {57290#false} is VALID [2022-02-20 19:53:15,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {57290#false} assume !(node1_~m1~0#1 != ~nomsg~0); {57290#false} is VALID [2022-02-20 19:53:15,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {57290#false} ~mode1~0 := 0; {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {57290#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {57290#false} assume !(node2_~m2~0#1 != ~nomsg~0); {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {57290#false} ~mode2~0 := 0; {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 76: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {57290#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {57290#false} assume !(node3_~m3~0#1 != ~nomsg~0); {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {57290#false} ~mode3~0 := 0; {57290#false} is VALID [2022-02-20 19:53:15,604 INFO L290 TraceCheckUtils]: 80: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,605 INFO L290 TraceCheckUtils]: 81: Hoare triple {57290#false} assume !(0 != ~mode4~0 % 256); {57290#false} is VALID [2022-02-20 19:53:15,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {57290#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {57290#false} is VALID [2022-02-20 19:53:15,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {57290#false} assume !(0 != ~mode5~0 % 256); {57290#false} is VALID [2022-02-20 19:53:15,605 INFO L290 TraceCheckUtils]: 86: Hoare triple {57290#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {57290#false} is VALID [2022-02-20 19:53:15,605 INFO L290 TraceCheckUtils]: 87: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,605 INFO L290 TraceCheckUtils]: 88: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,606 INFO L290 TraceCheckUtils]: 89: Hoare triple {57290#false} assume !(0 != ~mode6~0 % 256); {57290#false} is VALID [2022-02-20 19:53:15,606 INFO L290 TraceCheckUtils]: 90: Hoare triple {57290#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {57290#false} is VALID [2022-02-20 19:53:15,606 INFO L290 TraceCheckUtils]: 91: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,606 INFO L290 TraceCheckUtils]: 92: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,606 INFO L290 TraceCheckUtils]: 93: Hoare triple {57290#false} assume !(0 != ~mode7~0 % 256); {57290#false} is VALID [2022-02-20 19:53:15,606 INFO L290 TraceCheckUtils]: 94: Hoare triple {57290#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {57290#false} is VALID [2022-02-20 19:53:15,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,607 INFO L290 TraceCheckUtils]: 97: Hoare triple {57290#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {57290#false} is VALID [2022-02-20 19:53:15,607 INFO L290 TraceCheckUtils]: 98: Hoare triple {57290#false} assume !(node8_~m8~0#1 != ~nomsg~0); {57290#false} is VALID [2022-02-20 19:53:15,607 INFO L290 TraceCheckUtils]: 99: Hoare triple {57290#false} ~mode8~0 := 0; {57290#false} is VALID [2022-02-20 19:53:15,607 INFO L290 TraceCheckUtils]: 100: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,607 INFO L290 TraceCheckUtils]: 101: Hoare triple {57290#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {57290#false} is VALID [2022-02-20 19:53:15,607 INFO L290 TraceCheckUtils]: 102: Hoare triple {57290#false} check_#res#1 := check_~tmp~1#1; {57290#false} is VALID [2022-02-20 19:53:15,607 INFO L290 TraceCheckUtils]: 103: Hoare triple {57290#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; {57290#false} is VALID [2022-02-20 19:53:15,607 INFO L290 TraceCheckUtils]: 104: Hoare triple {57290#false} assume 0 == assert_~arg#1 % 256; {57290#false} is VALID [2022-02-20 19:53:15,608 INFO L290 TraceCheckUtils]: 105: Hoare triple {57290#false} assume !false; {57290#false} is VALID [2022-02-20 19:53:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:15,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:15,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297803052] [2022-02-20 19:53:15,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297803052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:15,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:15,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:15,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719729955] [2022-02-20 19:53:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:15,609 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:15,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:15,610 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:15,679 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:15,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:15,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:15,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:15,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:15,680 INFO L87 Difference]: Start difference. First operand 6154 states and 7973 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:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:18,673 INFO L93 Difference]: Finished difference Result 6300 states and 8205 transitions. [2022-02-20 19:53:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:18,673 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:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:18,673 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:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:18,678 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:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:18,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:53:20,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:21,334 INFO L225 Difference]: With dead ends: 6300 [2022-02-20 19:53:21,334 INFO L226 Difference]: Without dead ends: 6224 [2022-02-20 19:53:21,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:21,335 INFO L933 BasicCegarLoop]: 1734 mSDtfsCounter, 1550 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:21,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1550 Valid, 1853 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2022-02-20 19:53:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 6222. [2022-02-20 19:53:21,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:21,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6224 states. Second operand has 6222 states, 6220 states have (on average 1.2993569131832798) internal successors, (8082), 6221 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have 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:21,451 INFO L74 IsIncluded]: Start isIncluded. First operand 6224 states. Second operand has 6222 states, 6220 states have (on average 1.2993569131832798) internal successors, (8082), 6221 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have 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:21,457 INFO L87 Difference]: Start difference. First operand 6224 states. Second operand has 6222 states, 6220 states have (on average 1.2993569131832798) internal successors, (8082), 6221 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have 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:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:22,539 INFO L93 Difference]: Finished difference Result 6224 states and 8083 transitions. [2022-02-20 19:53:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 8083 transitions. [2022-02-20 19:53:22,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:22,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:22,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 6222 states, 6220 states have (on average 1.2993569131832798) internal successors, (8082), 6221 states have internal predecessors, (8082), 0 states have call successors, (0), 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 6224 states. [2022-02-20 19:53:22,557 INFO L87 Difference]: Start difference. First operand has 6222 states, 6220 states have (on average 1.2993569131832798) internal successors, (8082), 6221 states have internal predecessors, (8082), 0 states have call successors, (0), 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 6224 states. [2022-02-20 19:53:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:23,714 INFO L93 Difference]: Finished difference Result 6224 states and 8083 transitions. [2022-02-20 19:53:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 8083 transitions. [2022-02-20 19:53:23,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:23,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:23,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:23,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 6220 states have (on average 1.2993569131832798) internal successors, (8082), 6221 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have 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:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 8082 transitions. [2022-02-20 19:53:24,987 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 8082 transitions. Word has length 106 [2022-02-20 19:53:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:24,987 INFO L470 AbstractCegarLoop]: Abstraction has 6222 states and 8082 transitions. [2022-02-20 19:53:24,987 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 19:53:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 8082 transitions. [2022-02-20 19:53:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:24,988 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:24,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:53:24,988 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash 326222874, now seen corresponding path program 1 times [2022-02-20 19:53:24,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:24,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449298005] [2022-02-20 19:53:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:25,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {82401#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; {82401#true} is VALID [2022-02-20 19:53:25,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {82401#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; {82401#true} is VALID [2022-02-20 19:53:25,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {82401#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; {82401#true} is VALID [2022-02-20 19:53:25,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {82401#true} assume 0 == ~r1~0; {82401#true} is VALID [2022-02-20 19:53:25,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {82401#true} assume ~id1~0 >= 0; {82401#true} is VALID [2022-02-20 19:53:25,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {82401#true} assume 0 == ~st1~0; {82401#true} is VALID [2022-02-20 19:53:25,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {82401#true} assume ~send1~0 == ~id1~0; {82401#true} is VALID [2022-02-20 19:53:25,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {82401#true} assume 0 == ~mode1~0 % 256; {82401#true} is VALID [2022-02-20 19:53:25,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {82401#true} assume ~id2~0 >= 0; {82401#true} is VALID [2022-02-20 19:53:25,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {82401#true} assume 0 == ~st2~0; {82401#true} is VALID [2022-02-20 19:53:25,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {82401#true} assume ~send2~0 == ~id2~0; {82401#true} is VALID [2022-02-20 19:53:25,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {82401#true} assume 0 == ~mode2~0 % 256; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,101 INFO L290 TraceCheckUtils]: 58: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~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; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,105 INFO L290 TraceCheckUtils]: 69: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,106 INFO L290 TraceCheckUtils]: 72: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:25,107 INFO L290 TraceCheckUtils]: 73: Hoare triple {82403#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {82402#false} is VALID [2022-02-20 19:53:25,107 INFO L290 TraceCheckUtils]: 74: Hoare triple {82402#false} assume !(node2_~m2~0#1 != ~nomsg~0); {82402#false} is VALID [2022-02-20 19:53:25,107 INFO L290 TraceCheckUtils]: 75: Hoare triple {82402#false} ~mode2~0 := 0; {82402#false} is VALID [2022-02-20 19:53:25,107 INFO L290 TraceCheckUtils]: 76: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,107 INFO L290 TraceCheckUtils]: 77: Hoare triple {82402#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {82402#false} is VALID [2022-02-20 19:53:25,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {82402#false} assume !(node3_~m3~0#1 != ~nomsg~0); {82402#false} is VALID [2022-02-20 19:53:25,108 INFO L290 TraceCheckUtils]: 79: Hoare triple {82402#false} ~mode3~0 := 0; {82402#false} is VALID [2022-02-20 19:53:25,108 INFO L290 TraceCheckUtils]: 80: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,108 INFO L290 TraceCheckUtils]: 81: Hoare triple {82402#false} assume !(0 != ~mode4~0 % 256); {82402#false} is VALID [2022-02-20 19:53:25,108 INFO L290 TraceCheckUtils]: 82: Hoare triple {82402#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {82402#false} is VALID [2022-02-20 19:53:25,108 INFO L290 TraceCheckUtils]: 83: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,108 INFO L290 TraceCheckUtils]: 84: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,108 INFO L290 TraceCheckUtils]: 85: Hoare triple {82402#false} assume !(0 != ~mode5~0 % 256); {82402#false} is VALID [2022-02-20 19:53:25,108 INFO L290 TraceCheckUtils]: 86: Hoare triple {82402#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 87: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 88: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 89: Hoare triple {82402#false} assume !(0 != ~mode6~0 % 256); {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 90: Hoare triple {82402#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 91: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 92: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 93: Hoare triple {82402#false} assume !(0 != ~mode7~0 % 256); {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 94: Hoare triple {82402#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {82402#false} is VALID [2022-02-20 19:53:25,109 INFO L290 TraceCheckUtils]: 95: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 96: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 97: Hoare triple {82402#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 98: Hoare triple {82402#false} assume !(node8_~m8~0#1 != ~nomsg~0); {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 99: Hoare triple {82402#false} ~mode8~0 := 0; {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 101: Hoare triple {82402#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 102: Hoare triple {82402#false} check_#res#1 := check_~tmp~1#1; {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 103: Hoare triple {82402#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; {82402#false} is VALID [2022-02-20 19:53:25,110 INFO L290 TraceCheckUtils]: 104: Hoare triple {82402#false} assume 0 == assert_~arg#1 % 256; {82402#false} is VALID [2022-02-20 19:53:25,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {82402#false} assume !false; {82402#false} is VALID [2022-02-20 19:53:25,111 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:25,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:25,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449298005] [2022-02-20 19:53:25,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449298005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:25,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:25,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:25,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798622221] [2022-02-20 19:53:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:25,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:25,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:25,113 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:25,176 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:25,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:25,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:25,177 INFO L87 Difference]: Start difference. First operand 6222 states and 8082 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)