./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdba2ae989c969b8ea983da7229bdc32604e4ef890fc1d03498078fc576fe644 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:50:41,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:50:41,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:50:41,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:50:41,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:50:41,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:50:41,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:50:41,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:50:41,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:50:41,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:50:41,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:50:41,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:50:41,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:50:41,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:50:41,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:50:41,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:50:41,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:50:41,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:50:41,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:50:41,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:50:41,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:50:41,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:50:41,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:50:41,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:50:41,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:50:41,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:50:41,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:50:41,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:50:41,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:50:41,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:50:41,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:50:41,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:50:41,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:50:41,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:50:41,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:50:41,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:50:41,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:50:41,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:50:41,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:50:41,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:50:41,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:50:41,882 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:50:41,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:50:41,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:50:41,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:50:41,906 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:50:41,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:50:41,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:50:41,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:50:41,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:50:41,908 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:50:41,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:50:41,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:50:41,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:50:41,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:50:41,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:50:41,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:50:41,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:50:41,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:50:41,910 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:50:41,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:50:41,910 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:50:41,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:50:41,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:50:41,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:50:41,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:50:41,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:41,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:50:41,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:50:41,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:50:41,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:50:41,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:50:41,912 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:50:41,912 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:50:41,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:50:41,912 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 -> fdba2ae989c969b8ea983da7229bdc32604e4ef890fc1d03498078fc576fe644 [2022-02-20 19:50:42,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:50:42,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:50:42,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:50:42,118 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:50:42,118 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:50:42,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:50:42,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8074bedc4/d81db3bebf41403e9c60cf8b70cb4812/FLAG728ae5f94 [2022-02-20 19:50:42,675 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:50:42,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:50:42,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8074bedc4/d81db3bebf41403e9c60cf8b70cb4812/FLAG728ae5f94 [2022-02-20 19:50:42,901 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8074bedc4/d81db3bebf41403e9c60cf8b70cb4812 [2022-02-20 19:50:42,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:50:42,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:50:42,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:42,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:50:42,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:50:42,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:42" (1/1) ... [2022-02-20 19:50:42,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd72ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:42, skipping insertion in model container [2022-02-20 19:50:42,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:42" (1/1) ... [2022-02-20 19:50:42,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:50:42,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:50:43,243 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.7.ufo.UNBOUNDED.pals+Problem12_label07.c[20454,20467] [2022-02-20 19:50:43,255 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.7.ufo.UNBOUNDED.pals+Problem12_label07.c[21296,21309] [2022-02-20 19:50:43,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:43,796 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:50:43,845 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.7.ufo.UNBOUNDED.pals+Problem12_label07.c[20454,20467] [2022-02-20 19:50:43,847 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.7.ufo.UNBOUNDED.pals+Problem12_label07.c[21296,21309] [2022-02-20 19:50:44,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:44,171 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:50:44,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44 WrapperNode [2022-02-20 19:50:44,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:44,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:44,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:50:44,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:50:44,178 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:50:44" (1/1) ... [2022-02-20 19:50:44,226 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:50:44" (1/1) ... [2022-02-20 19:50:44,630 INFO L137 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5208 [2022-02-20 19:50:44,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:44,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:50:44,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:50:44,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:50:44,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (1/1) ... [2022-02-20 19:50:44,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (1/1) ... [2022-02-20 19:50:44,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (1/1) ... [2022-02-20 19:50:44,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (1/1) ... [2022-02-20 19:50:44,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (1/1) ... [2022-02-20 19:50:44,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (1/1) ... [2022-02-20 19:50:44,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (1/1) ... [2022-02-20 19:50:45,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:50:45,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:50:45,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:50:45,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:50:45,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (1/1) ... [2022-02-20 19:50:45,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:45,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:50:45,059 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:50:45,076 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:50:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:50:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:50:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:50:45,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:50:45,216 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:50:45,217 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:50:51,676 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:50:51,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:50:51,690 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:50:51,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:51 BoogieIcfgContainer [2022-02-20 19:50:51,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:50:51,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:50:51,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:50:51,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:50:51,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:50:42" (1/3) ... [2022-02-20 19:50:51,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a11bc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:51, skipping insertion in model container [2022-02-20 19:50:51,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:44" (2/3) ... [2022-02-20 19:50:51,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a11bc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:51, skipping insertion in model container [2022-02-20 19:50:51,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:51" (3/3) ... [2022-02-20 19:50:51,700 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:50:51,703 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:50:51,703 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:50:51,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:50:51,761 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:50:51,761 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:50:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 19:50:51,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:51,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:50:51,797 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1910581880, now seen corresponding path program 1 times [2022-02-20 19:50:51,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:51,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210675539] [2022-02-20 19:50:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:51,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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;~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; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:51,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:51,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet57#1);havoc main_#t~nondet57#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet55#1, main2_#t~ret56#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:51,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:51,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {951#(<= (+ ~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~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:51,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {950#false} is VALID [2022-02-20 19:50:51,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#false} assume !false; {950#false} is VALID [2022-02-20 19:50:51,964 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:50:51,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:51,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210675539] [2022-02-20 19:50:51,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210675539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:51,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:51,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:51,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311392149] [2022-02-20 19:50:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:51,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 19:50:51,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:51,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:52,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:52,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:52,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:52,034 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:57,686 INFO L93 Difference]: Finished difference Result 2605 states and 4986 transitions. [2022-02-20 19:50:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:57,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 19:50:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4986 transitions. [2022-02-20 19:50:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4986 transitions. [2022-02-20 19:50:57,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4986 transitions. [2022-02-20 19:51:01,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4986 edges. 4986 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:01,475 INFO L225 Difference]: With dead ends: 2605 [2022-02-20 19:51:01,476 INFO L226 Difference]: Without dead ends: 1631 [2022-02-20 19:51:01,480 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:51:01,483 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 1031 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 744 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.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:01,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1031 Valid, 744 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:51:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-02-20 19:51:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-02-20 19:51:01,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:01,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:01,590 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:01,593 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:01,683 INFO L93 Difference]: Finished difference Result 1631 states and 2635 transitions. [2022-02-20 19:51:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2635 transitions. [2022-02-20 19:51:01,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:01,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:01,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:51:01,700 INFO L87 Difference]: Start difference. First operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:51:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:01,787 INFO L93 Difference]: Finished difference Result 1631 states and 2635 transitions. [2022-02-20 19:51:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2635 transitions. [2022-02-20 19:51:01,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:01,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:01,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:01,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2635 transitions. [2022-02-20 19:51:01,881 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2635 transitions. Word has length 7 [2022-02-20 19:51:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:01,882 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2635 transitions. [2022-02-20 19:51:01,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2635 transitions. [2022-02-20 19:51:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:51:01,883 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:01,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:01,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:51:01,884 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1343709944, now seen corresponding path program 1 times [2022-02-20 19:51:01,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:01,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140128473] [2022-02-20 19:51:01,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:01,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {8513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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;~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; {8513#true} is VALID [2022-02-20 19:51:01,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {8513#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {8513#true} is VALID [2022-02-20 19:51:01,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {8513#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8513#true} is VALID [2022-02-20 19:51:01,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {8513#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8515#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:51:01,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {8515#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8516#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:51:01,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {8516#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {8517#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:51:01,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {8517#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8514#false} is VALID [2022-02-20 19:51:01,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {8514#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;main1_~i2~0#1 := 0; {8514#false} is VALID [2022-02-20 19:51:01,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {8514#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:51:01,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {8514#false} assume !(0 != ~mode1~0 % 256); {8514#false} is VALID [2022-02-20 19:51:01,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {8514#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8514#false} is VALID [2022-02-20 19:51:01,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {8514#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8514#false} is VALID [2022-02-20 19:51:01,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {8514#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; {8514#false} is VALID [2022-02-20 19:51:01,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {8514#false} assume !(0 != ~mode2~0 % 256); {8514#false} is VALID [2022-02-20 19:51:01,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {8514#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8514#false} is VALID [2022-02-20 19:51:01,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {8514#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8514#false} is VALID [2022-02-20 19:51:01,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {8514#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; {8514#false} is VALID [2022-02-20 19:51:01,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {8514#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:51:01,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {8514#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:51:01,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {8514#false} ~mode3~0 := 0; {8514#false} is VALID [2022-02-20 19:51:01,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {8514#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; {8514#false} is VALID [2022-02-20 19:51:01,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {8514#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:51:01,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {8514#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:51:01,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {8514#false} ~mode4~0 := 0; {8514#false} is VALID [2022-02-20 19:51:01,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {8514#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; {8514#false} is VALID [2022-02-20 19:51:01,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {8514#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:51:01,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {8514#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:51:01,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {8514#false} ~mode5~0 := 0; {8514#false} is VALID [2022-02-20 19:51:01,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {8514#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; {8514#false} is VALID [2022-02-20 19:51:01,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {8514#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:51:01,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {8514#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:51:01,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {8514#false} ~mode6~0 := 0; {8514#false} is VALID [2022-02-20 19:51:01,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {8514#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; {8514#false} is VALID [2022-02-20 19:51:01,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {8514#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:51:01,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {8514#false} assume !(node7_~m7~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:51:01,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {8514#false} ~mode7~0 := 0; {8514#false} is VALID [2022-02-20 19:51:01,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {8514#false} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8514#false} is VALID [2022-02-20 19:51:01,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {8514#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {8514#false} is VALID [2022-02-20 19:51:01,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {8514#false} check_#res#1 := check_~tmp~1#1; {8514#false} is VALID [2022-02-20 19:51:01,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {8514#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {8514#false} is VALID [2022-02-20 19:51:01,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {8514#false} assume 0 == assert_~arg#1 % 256; {8514#false} is VALID [2022-02-20 19:51:01,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {8514#false} assume !false; {8514#false} is VALID [2022-02-20 19:51:01,989 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:51:01,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:01,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140128473] [2022-02-20 19:51:01,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140128473] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:01,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:01,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:51:01,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483170643] [2022-02-20 19:51:01,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:01,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 19:51:01,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:01,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:02,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:02,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:51:02,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:02,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:51:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:51:02,017 INFO L87 Difference]: Start difference. First operand 1631 states and 2635 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:05,976 INFO L93 Difference]: Finished difference Result 1705 states and 2750 transitions. [2022-02-20 19:51:05,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:51:05,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 19:51:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1771 transitions. [2022-02-20 19:51:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1771 transitions. [2022-02-20 19:51:05,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1771 transitions. [2022-02-20 19:51:07,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1771 edges. 1771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:07,365 INFO L225 Difference]: With dead ends: 1705 [2022-02-20 19:51:07,365 INFO L226 Difference]: Without dead ends: 1631 [2022-02-20 19:51:07,366 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:51:07,366 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 3 mSDsluCounter, 4909 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6563 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:07,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6563 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-02-20 19:51:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-02-20 19:51:07,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:07,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,395 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,398 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:07,482 INFO L93 Difference]: Finished difference Result 1631 states and 2585 transitions. [2022-02-20 19:51:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2585 transitions. [2022-02-20 19:51:07,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:07,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:07,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:51:07,489 INFO L87 Difference]: Start difference. First operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:51:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:07,570 INFO L93 Difference]: Finished difference Result 1631 states and 2585 transitions. [2022-02-20 19:51:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2585 transitions. [2022-02-20 19:51:07,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:07,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:07,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:07,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2585 transitions. [2022-02-20 19:51:07,662 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2585 transitions. Word has length 42 [2022-02-20 19:51:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:07,662 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2585 transitions. [2022-02-20 19:51:07,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2585 transitions. [2022-02-20 19:51:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 19:51:07,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:07,665 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:07,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:51:07,666 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1588987219, now seen corresponding path program 1 times [2022-02-20 19:51:07,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:07,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168700343] [2022-02-20 19:51:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:07,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {15175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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;~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; {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {15177#(<= ~a5~0 4)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {15177#(<= ~a5~0 4)} assume !(0 != main_#t~nondet57#1);havoc main_#t~nondet57#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet55#1, main2_#t~ret56#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {15177#(<= ~a5~0 4)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {15177#(<= ~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~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,878 INFO L290 TraceCheckUtils]: 55: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,878 INFO L290 TraceCheckUtils]: 56: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {15177#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {15177#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {15177#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,885 INFO L290 TraceCheckUtils]: 69: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,887 INFO L290 TraceCheckUtils]: 72: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,887 INFO L290 TraceCheckUtils]: 73: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,887 INFO L290 TraceCheckUtils]: 74: Hoare triple {15177#(<= ~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); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,888 INFO L290 TraceCheckUtils]: 75: Hoare triple {15177#(<= ~a5~0 4)} assume !(((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0); {15177#(<= ~a5~0 4)} is VALID [2022-02-20 19:51:07,888 INFO L290 TraceCheckUtils]: 76: Hoare triple {15177#(<= ~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; {15176#false} is VALID [2022-02-20 19:51:07,889 INFO L290 TraceCheckUtils]: 77: Hoare triple {15176#false} main2_#t~ret56#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret56#1 && main2_#t~ret56#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret56#1;havoc main2_#t~ret56#1; {15176#false} is VALID [2022-02-20 19:51:07,889 INFO L290 TraceCheckUtils]: 78: Hoare triple {15176#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {15176#false} is VALID [2022-02-20 19:51:07,889 INFO L290 TraceCheckUtils]: 79: Hoare triple {15176#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~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15176#false} is VALID [2022-02-20 19:51:07,889 INFO L290 TraceCheckUtils]: 80: Hoare triple {15176#false} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {15176#false} is VALID [2022-02-20 19:51:07,889 INFO L290 TraceCheckUtils]: 81: Hoare triple {15176#false} assume !false; {15176#false} is VALID [2022-02-20 19:51:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:07,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:07,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168700343] [2022-02-20 19:51:07,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168700343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:07,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:07,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:51:07,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677972559] [2022-02-20 19:51:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:07,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 19:51:07,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:07,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:07,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:07,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:07,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:07,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:07,946 INFO L87 Difference]: Start difference. First operand 1631 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:12,941 INFO L93 Difference]: Finished difference Result 4637 states and 7416 transitions. [2022-02-20 19:51:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:12,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 19:51:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4479 transitions. [2022-02-20 19:51:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4479 transitions. [2022-02-20 19:51:12,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4479 transitions. [2022-02-20 19:51:16,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4479 edges. 4479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:16,456 INFO L225 Difference]: With dead ends: 4637 [2022-02-20 19:51:16,456 INFO L226 Difference]: Without dead ends: 3133 [2022-02-20 19:51:16,458 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:51:16,458 INFO L933 BasicCegarLoop]: 610 mSDtfsCounter, 940 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 616 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:51:16,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [940 Valid, 616 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 19:51:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2022-02-20 19:51:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3133. [2022-02-20 19:51:16,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:16,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3133 states. Second operand has 3133 states, 3131 states have (on average 1.412967103161929) internal successors, (4424), 3132 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,527 INFO L74 IsIncluded]: Start isIncluded. First operand 3133 states. Second operand has 3133 states, 3131 states have (on average 1.412967103161929) internal successors, (4424), 3132 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,532 INFO L87 Difference]: Start difference. First operand 3133 states. Second operand has 3133 states, 3131 states have (on average 1.412967103161929) internal successors, (4424), 3132 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:16,871 INFO L93 Difference]: Finished difference Result 3133 states and 4424 transitions. [2022-02-20 19:51:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4424 transitions. [2022-02-20 19:51:16,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:16,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:16,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 3133 states, 3131 states have (on average 1.412967103161929) internal successors, (4424), 3132 states have internal predecessors, (4424), 0 states have call successors, (0), 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 3133 states. [2022-02-20 19:51:16,885 INFO L87 Difference]: Start difference. First operand has 3133 states, 3131 states have (on average 1.412967103161929) internal successors, (4424), 3132 states have internal predecessors, (4424), 0 states have call successors, (0), 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 3133 states. [2022-02-20 19:51:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:17,210 INFO L93 Difference]: Finished difference Result 3133 states and 4424 transitions. [2022-02-20 19:51:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4424 transitions. [2022-02-20 19:51:17,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:17,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:17,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:17,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3131 states have (on average 1.412967103161929) internal successors, (4424), 3132 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4424 transitions. [2022-02-20 19:51:17,578 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4424 transitions. Word has length 82 [2022-02-20 19:51:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:17,579 INFO L470 AbstractCegarLoop]: Abstraction has 3133 states and 4424 transitions. [2022-02-20 19:51:17,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4424 transitions. [2022-02-20 19:51:17,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 19:51:17,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:17,580 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:17,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:51:17,581 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash -232369458, now seen corresponding path program 1 times [2022-02-20 19:51:17,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:17,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029362738] [2022-02-20 19:51:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:17,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:17,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {29288#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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;~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; {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet57#1);havoc main_#t~nondet57#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet55#1, main2_#t~ret56#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:17,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {29290#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,787 INFO L290 TraceCheckUtils]: 59: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,787 INFO L290 TraceCheckUtils]: 60: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,789 INFO L290 TraceCheckUtils]: 66: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,789 INFO L290 TraceCheckUtils]: 67: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,791 INFO L290 TraceCheckUtils]: 71: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,791 INFO L290 TraceCheckUtils]: 72: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,792 INFO L290 TraceCheckUtils]: 74: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} 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); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} 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); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} 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); {29291#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:17,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {29291#(not (= (+ ~a7~0 (- 12)) 0))} 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; {29289#false} is VALID [2022-02-20 19:51:17,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {29289#false} main2_#t~ret56#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret56#1 && main2_#t~ret56#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret56#1;havoc main2_#t~ret56#1; {29289#false} is VALID [2022-02-20 19:51:17,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {29289#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {29289#false} is VALID [2022-02-20 19:51:17,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {29289#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~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {29289#false} is VALID [2022-02-20 19:51:17,794 INFO L290 TraceCheckUtils]: 82: Hoare triple {29289#false} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {29289#false} is VALID [2022-02-20 19:51:17,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {29289#false} assume !false; {29289#false} is VALID [2022-02-20 19:51:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:17,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:17,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029362738] [2022-02-20 19:51:17,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029362738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:17,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:17,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:17,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104869068] [2022-02-20 19:51:17,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:17,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2022-02-20 19:51:17,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:17,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:17,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:17,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:51:17,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:17,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:51:17,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:51:17,855 INFO L87 Difference]: Start difference. First operand 3133 states and 4424 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:29,893 INFO L93 Difference]: Finished difference Result 9894 states and 13768 transitions. [2022-02-20 19:51:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:51:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2022-02-20 19:51:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5314 transitions. [2022-02-20 19:51:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5314 transitions. [2022-02-20 19:51:29,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5314 transitions. [2022-02-20 19:51:33,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5314 edges. 5314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:35,453 INFO L225 Difference]: With dead ends: 9894 [2022-02-20 19:51:35,453 INFO L226 Difference]: Without dead ends: 6888 [2022-02-20 19:51:35,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:51:35,457 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 2515 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 5459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:35,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2515 Valid, 331 Invalid, 5459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-02-20 19:51:35,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6888 states. [2022-02-20 19:51:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6888 to 6888. [2022-02-20 19:51:35,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:35,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6888 states. Second operand has 6888 states, 6886 states have (on average 1.3510020331106594) internal successors, (9303), 6887 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:35,584 INFO L74 IsIncluded]: Start isIncluded. First operand 6888 states. Second operand has 6888 states, 6886 states have (on average 1.3510020331106594) internal successors, (9303), 6887 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:35,591 INFO L87 Difference]: Start difference. First operand 6888 states. Second operand has 6888 states, 6886 states have (on average 1.3510020331106594) internal successors, (9303), 6887 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:36,995 INFO L93 Difference]: Finished difference Result 6888 states and 9303 transitions. [2022-02-20 19:51:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 9303 transitions. [2022-02-20 19:51:37,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:37,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:37,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 6888 states, 6886 states have (on average 1.3510020331106594) internal successors, (9303), 6887 states have internal predecessors, (9303), 0 states have call successors, (0), 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 6888 states. [2022-02-20 19:51:37,012 INFO L87 Difference]: Start difference. First operand has 6888 states, 6886 states have (on average 1.3510020331106594) internal successors, (9303), 6887 states have internal predecessors, (9303), 0 states have call successors, (0), 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 6888 states. [2022-02-20 19:51:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:38,428 INFO L93 Difference]: Finished difference Result 6888 states and 9303 transitions. [2022-02-20 19:51:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 9303 transitions. [2022-02-20 19:51:38,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:38,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:38,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:38,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6888 states, 6886 states have (on average 1.3510020331106594) internal successors, (9303), 6887 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6888 states to 6888 states and 9303 transitions. [2022-02-20 19:51:39,976 INFO L78 Accepts]: Start accepts. Automaton has 6888 states and 9303 transitions. Word has length 84 [2022-02-20 19:51:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:39,976 INFO L470 AbstractCegarLoop]: Abstraction has 6888 states and 9303 transitions. [2022-02-20 19:51:39,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 9303 transitions. [2022-02-20 19:51:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:39,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:39,977 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] [2022-02-20 19:51:39,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:51:39,978 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash -461668761, now seen corresponding path program 1 times [2022-02-20 19:51:39,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:39,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493985422] [2022-02-20 19:51:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:39,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:40,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {59986#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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;~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; {59986#true} is VALID [2022-02-20 19:51:40,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {59986#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {59986#true} is VALID [2022-02-20 19:51:40,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {59986#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {59986#true} is VALID [2022-02-20 19:51:40,072 INFO L290 TraceCheckUtils]: 3: Hoare triple {59986#true} assume 0 == ~r1~0 % 256; {59986#true} is VALID [2022-02-20 19:51:40,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {59986#true} assume ~id1~0 >= 0; {59986#true} is VALID [2022-02-20 19:51:40,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {59986#true} assume 0 == ~st1~0; {59986#true} is VALID [2022-02-20 19:51:40,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {59986#true} assume ~send1~0 == ~id1~0; {59986#true} is VALID [2022-02-20 19:51:40,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {59986#true} assume 0 == ~mode1~0 % 256; {59986#true} is VALID [2022-02-20 19:51:40,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {59986#true} assume ~id2~0 >= 0; {59986#true} is VALID [2022-02-20 19:51:40,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {59986#true} assume 0 == ~st2~0; {59986#true} is VALID [2022-02-20 19:51:40,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {59986#true} assume ~send2~0 == ~id2~0; {59986#true} is VALID [2022-02-20 19:51:40,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {59986#true} assume 0 == ~mode2~0 % 256; {59986#true} is VALID [2022-02-20 19:51:40,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {59986#true} assume ~id3~0 >= 0; {59986#true} is VALID [2022-02-20 19:51:40,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {59986#true} assume 0 == ~st3~0; {59986#true} is VALID [2022-02-20 19:51:40,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {59986#true} assume ~send3~0 == ~id3~0; {59986#true} is VALID [2022-02-20 19:51:40,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {59986#true} assume 0 == ~mode3~0 % 256; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~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;main1_~i2~0#1 := 0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:40,097 INFO L290 TraceCheckUtils]: 66: Hoare triple {59988#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {59987#false} is VALID [2022-02-20 19:51:40,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {59987#false} assume !(node3_~m3~0#1 != ~nomsg~0); {59987#false} is VALID [2022-02-20 19:51:40,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {59987#false} ~mode3~0 := 0; {59987#false} is VALID [2022-02-20 19:51:40,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {59987#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; {59987#false} is VALID [2022-02-20 19:51:40,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {59987#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {59987#false} is VALID [2022-02-20 19:51:40,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {59987#false} assume !(node4_~m4~0#1 != ~nomsg~0); {59987#false} is VALID [2022-02-20 19:51:40,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {59987#false} ~mode4~0 := 0; {59987#false} is VALID [2022-02-20 19:51:40,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {59987#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; {59987#false} is VALID [2022-02-20 19:51:40,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {59987#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {59987#false} is VALID [2022-02-20 19:51:40,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {59987#false} assume !(node5_~m5~0#1 != ~nomsg~0); {59987#false} is VALID [2022-02-20 19:51:40,099 INFO L290 TraceCheckUtils]: 76: Hoare triple {59987#false} ~mode5~0 := 0; {59987#false} is VALID [2022-02-20 19:51:40,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {59987#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; {59987#false} is VALID [2022-02-20 19:51:40,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {59987#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {59987#false} is VALID [2022-02-20 19:51:40,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {59987#false} assume !(node6_~m6~0#1 != ~nomsg~0); {59987#false} is VALID [2022-02-20 19:51:40,100 INFO L290 TraceCheckUtils]: 80: Hoare triple {59987#false} ~mode6~0 := 0; {59987#false} is VALID [2022-02-20 19:51:40,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {59987#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; {59987#false} is VALID [2022-02-20 19:51:40,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {59987#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {59987#false} is VALID [2022-02-20 19:51:40,100 INFO L290 TraceCheckUtils]: 83: Hoare triple {59987#false} assume !(node7_~m7~0#1 != ~nomsg~0); {59987#false} is VALID [2022-02-20 19:51:40,100 INFO L290 TraceCheckUtils]: 84: Hoare triple {59987#false} ~mode7~0 := 0; {59987#false} is VALID [2022-02-20 19:51:40,102 INFO L290 TraceCheckUtils]: 85: Hoare triple {59987#false} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {59987#false} is VALID [2022-02-20 19:51:40,102 INFO L290 TraceCheckUtils]: 86: Hoare triple {59987#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {59987#false} is VALID [2022-02-20 19:51:40,103 INFO L290 TraceCheckUtils]: 87: Hoare triple {59987#false} check_#res#1 := check_~tmp~1#1; {59987#false} is VALID [2022-02-20 19:51:40,103 INFO L290 TraceCheckUtils]: 88: Hoare triple {59987#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {59987#false} is VALID [2022-02-20 19:51:40,103 INFO L290 TraceCheckUtils]: 89: Hoare triple {59987#false} assume 0 == assert_~arg#1 % 256; {59987#false} is VALID [2022-02-20 19:51:40,103 INFO L290 TraceCheckUtils]: 90: Hoare triple {59987#false} assume !false; {59987#false} is VALID [2022-02-20 19:51:40,105 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:51:40,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:40,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493985422] [2022-02-20 19:51:40,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493985422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:40,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:40,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:40,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731458134] [2022-02-20 19:51:40,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:40,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:51:40,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:40,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:40,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:40,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:40,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:40,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:40,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:40,178 INFO L87 Difference]: Start difference. First operand 6888 states and 9303 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:43,647 INFO L93 Difference]: Finished difference Result 7022 states and 9515 transitions. [2022-02-20 19:51:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:43,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:51:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:43,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions.