./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label06.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.6.ufo.UNBOUNDED.pals+Problem12_label06.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 1bec74f037fbf2dba90bb2f4059dc8dc2a6c7f2ca75c2fca684d0500ccd5ed9b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:48:00,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:48:00,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:48:00,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:48:00,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:48:00,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:48:00,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:48:00,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:48:00,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:48:00,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:48:00,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:48:00,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:48:00,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:48:00,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:48:00,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:48:00,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:48:00,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:48:00,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:48:00,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:48:00,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:48:00,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:48:00,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:48:00,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:48:00,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:48:00,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:48:00,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:48:00,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:48:00,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:48:00,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:48:00,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:48:00,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:48:00,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:48:00,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:48:00,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:48:01,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:48:01,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:48:01,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:48:01,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:48:01,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:48:01,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:48:01,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:48:01,009 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:48:01,053 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:48:01,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:48:01,054 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:48:01,054 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:48:01,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:48:01,055 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:48:01,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:48:01,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:48:01,056 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:48:01,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:48:01,058 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:48:01,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:48:01,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:48:01,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:48:01,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:48:01,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:48:01,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:48:01,059 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:48:01,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:48:01,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:48:01,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:48:01,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:48:01,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:48:01,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:48:01,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:48:01,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:48:01,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:48:01,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:48:01,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:48:01,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:48:01,062 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:48:01,062 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:48:01,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:48:01,062 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 -> 1bec74f037fbf2dba90bb2f4059dc8dc2a6c7f2ca75c2fca684d0500ccd5ed9b [2022-02-20 19:48:01,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:48:01,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:48:01,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:48:01,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:48:01,308 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:48:01,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:48:01,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd0f55c3/509a65548b5446ed9d4fc61d9954bfb5/FLAGfd0be4d3c [2022-02-20 19:48:02,001 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:48:02,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:48:02,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd0f55c3/509a65548b5446ed9d4fc61d9954bfb5/FLAGfd0be4d3c [2022-02-20 19:48:02,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd0f55c3/509a65548b5446ed9d4fc61d9954bfb5 [2022-02-20 19:48:02,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:48:02,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:48:02,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:48:02,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:48:02,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:48:02,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:48:02" (1/1) ... [2022-02-20 19:48:02,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67400a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:02, skipping insertion in model container [2022-02-20 19:48:02,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:48:02" (1/1) ... [2022-02-20 19:48:02,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:48:02,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:48:02,689 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.6.ufo.UNBOUNDED.pals+Problem12_label06.c[15510,15523] [2022-02-20 19:48:02,720 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.6.ufo.UNBOUNDED.pals+Problem12_label06.c[18327,18340] [2022-02-20 19:48:03,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:48:03,415 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:48:03,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label06.c[15510,15523] [2022-02-20 19:48:03,469 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.6.ufo.UNBOUNDED.pals+Problem12_label06.c[18327,18340] [2022-02-20 19:48:03,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:48:03,903 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:48:03,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03 WrapperNode [2022-02-20 19:48:03,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:48:03,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:48:03,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:48:03,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:48:03,911 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:48:03" (1/1) ... [2022-02-20 19:48:03,960 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:48:03" (1/1) ... [2022-02-20 19:48:04,416 INFO L137 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5147 [2022-02-20 19:48:04,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:48:04,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:48:04,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:48:04,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:48:04,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (1/1) ... [2022-02-20 19:48:04,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (1/1) ... [2022-02-20 19:48:04,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (1/1) ... [2022-02-20 19:48:04,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (1/1) ... [2022-02-20 19:48:04,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (1/1) ... [2022-02-20 19:48:04,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (1/1) ... [2022-02-20 19:48:04,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (1/1) ... [2022-02-20 19:48:04,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:48:04,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:48:04,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:48:04,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:48:04,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (1/1) ... [2022-02-20 19:48:04,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:48:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:48:04,904 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:48:04,928 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:48:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:48:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:48:04,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:48:04,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:48:05,075 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:48:05,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:48:12,945 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:48:12,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:48:12,960 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:48:12,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:48:12 BoogieIcfgContainer [2022-02-20 19:48:12,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:48:12,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:48:12,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:48:12,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:48:12,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:48:02" (1/3) ... [2022-02-20 19:48:12,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229149d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:48:12, skipping insertion in model container [2022-02-20 19:48:12,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:03" (2/3) ... [2022-02-20 19:48:12,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229149d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:48:12, skipping insertion in model container [2022-02-20 19:48:12,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:48:12" (3/3) ... [2022-02-20 19:48:12,970 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:48:12,974 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:48:12,974 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:48:13,016 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:48:13,021 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:48:13,022 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:48:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 928 states, 925 states have (on average 1.8983783783783783) internal successors, (1756), 927 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 19:48:13,076 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:13,076 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] [2022-02-20 19:48:13,077 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash 598417685, now seen corresponding path program 1 times [2022-02-20 19:48:13,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:13,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138762733] [2022-02-20 19:48:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:13,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {931#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;~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; {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet52#1);havoc main_#t~nondet52#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet50#1, main2_#t~ret51#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet50#1 && main2_#t~nondet50#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet50#1;havoc main2_#t~nondet50#1; {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {933#(<= (+ ~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~ret47#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {933#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:48:13,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {933#(<= (+ ~a17~0 124) 0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {932#false} is VALID [2022-02-20 19:48:13,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {932#false} assume !false; {932#false} is VALID [2022-02-20 19:48:13,405 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:48:13,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:13,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138762733] [2022-02-20 19:48:13,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138762733] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:13,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:13,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:48:13,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696369640] [2022-02-20 19:48:13,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:13,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:48:13,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:13,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:13,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:13,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:13,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:13,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:13,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:13,478 INFO L87 Difference]: Start difference. First operand has 928 states, 925 states have (on average 1.8983783783783783) internal successors, (1756), 927 states have internal predecessors, (1756), 0 states have call successors, (0), 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 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:19,807 INFO L93 Difference]: Finished difference Result 2579 states and 4940 transitions. [2022-02-20 19:48:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:19,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:48:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4940 transitions. [2022-02-20 19:48:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4940 transitions. [2022-02-20 19:48:19,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4940 transitions. [2022-02-20 19:48:23,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4940 edges. 4940 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:23,939 INFO L225 Difference]: With dead ends: 2579 [2022-02-20 19:48:23,939 INFO L226 Difference]: Without dead ends: 1613 [2022-02-20 19:48:23,950 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:48:23,954 INFO L933 BasicCegarLoop]: 700 mSDtfsCounter, 981 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 711 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.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:23,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [981 Valid, 711 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-02-20 19:48:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2022-02-20 19:48:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2022-02-20 19:48:24,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:24,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.6151458721291123) internal successors, (2602), 1612 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,093 INFO L74 IsIncluded]: Start isIncluded. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.6151458721291123) internal successors, (2602), 1612 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,096 INFO L87 Difference]: Start difference. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.6151458721291123) internal successors, (2602), 1612 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:24,221 INFO L93 Difference]: Finished difference Result 1613 states and 2602 transitions. [2022-02-20 19:48:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2602 transitions. [2022-02-20 19:48:24,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:24,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:24,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 1613 states, 1611 states have (on average 1.6151458721291123) internal successors, (2602), 1612 states have internal predecessors, (2602), 0 states have call successors, (0), 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 1613 states. [2022-02-20 19:48:24,239 INFO L87 Difference]: Start difference. First operand has 1613 states, 1611 states have (on average 1.6151458721291123) internal successors, (2602), 1612 states have internal predecessors, (2602), 0 states have call successors, (0), 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 1613 states. [2022-02-20 19:48:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:24,349 INFO L93 Difference]: Finished difference Result 1613 states and 2602 transitions. [2022-02-20 19:48:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2602 transitions. [2022-02-20 19:48:24,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:24,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:24,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:24,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1611 states have (on average 1.6151458721291123) internal successors, (2602), 1612 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2602 transitions. [2022-02-20 19:48:24,484 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2602 transitions. Word has length 24 [2022-02-20 19:48:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:24,485 INFO L470 AbstractCegarLoop]: Abstraction has 1613 states and 2602 transitions. [2022-02-20 19:48:24,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2602 transitions. [2022-02-20 19:48:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:48:24,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:24,487 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] [2022-02-20 19:48:24,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:48:24,493 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash -46774319, now seen corresponding path program 1 times [2022-02-20 19:48:24,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:24,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672849666] [2022-02-20 19:48:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:24,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:24,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {8412#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;~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; {8412#true} is VALID [2022-02-20 19:48:24,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {8412#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {8412#true} is VALID [2022-02-20 19:48:24,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {8412#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret36#1, main1_#t~ret37#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~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8412#true} is VALID [2022-02-20 19:48:24,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {8412#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8414#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:48:24,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {8414#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8415#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:48:24,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {8415#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {8416#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:48:24,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {8416#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8413#false} is VALID [2022-02-20 19:48:24,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {8413#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;main1_~i2~0#1 := 0; {8413#false} is VALID [2022-02-20 19:48:24,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {8413#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; {8413#false} is VALID [2022-02-20 19:48:24,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {8413#false} assume !(0 != ~mode1~0 % 256); {8413#false} is VALID [2022-02-20 19:48:24,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {8413#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8413#false} is VALID [2022-02-20 19:48:24,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {8413#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; {8413#false} is VALID [2022-02-20 19:48:24,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {8413#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; {8413#false} is VALID [2022-02-20 19:48:24,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {8413#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8413#false} is VALID [2022-02-20 19:48:24,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {8413#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8413#false} is VALID [2022-02-20 19:48:24,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {8413#false} ~mode2~0 := 0; {8413#false} is VALID [2022-02-20 19:48:24,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {8413#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; {8413#false} is VALID [2022-02-20 19:48:24,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {8413#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8413#false} is VALID [2022-02-20 19:48:24,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {8413#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8413#false} is VALID [2022-02-20 19:48:24,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {8413#false} ~mode3~0 := 0; {8413#false} is VALID [2022-02-20 19:48:24,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {8413#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; {8413#false} is VALID [2022-02-20 19:48:24,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {8413#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8413#false} is VALID [2022-02-20 19:48:24,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {8413#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8413#false} is VALID [2022-02-20 19:48:24,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {8413#false} ~mode4~0 := 0; {8413#false} is VALID [2022-02-20 19:48:24,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {8413#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; {8413#false} is VALID [2022-02-20 19:48:24,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {8413#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8413#false} is VALID [2022-02-20 19:48:24,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {8413#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8413#false} is VALID [2022-02-20 19:48:24,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {8413#false} ~mode5~0 := 0; {8413#false} is VALID [2022-02-20 19:48:24,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {8413#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; {8413#false} is VALID [2022-02-20 19:48:24,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {8413#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8413#false} is VALID [2022-02-20 19:48:24,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {8413#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8413#false} is VALID [2022-02-20 19:48:24,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {8413#false} ~mode6~0 := 0; {8413#false} is VALID [2022-02-20 19:48:24,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {8413#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8413#false} is VALID [2022-02-20 19:48:24,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {8413#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {8413#false} is VALID [2022-02-20 19:48:24,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {8413#false} check_#res#1 := check_~tmp~1#1; {8413#false} is VALID [2022-02-20 19:48:24,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {8413#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {8413#false} is VALID [2022-02-20 19:48:24,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {8413#false} assume 0 == assert_~arg#1 % 256; {8413#false} is VALID [2022-02-20 19:48:24,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {8413#false} assume !false; {8413#false} is VALID [2022-02-20 19:48:24,617 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:48:24,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:24,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672849666] [2022-02-20 19:48:24,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672849666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:24,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:24,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:48:24,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926108007] [2022-02-20 19:48:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:24,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:48:24,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:24,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:24,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:24,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:48:24,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:24,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:48:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:48:24,655 INFO L87 Difference]: Start difference. First operand 1613 states and 2602 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:28,964 INFO L93 Difference]: Finished difference Result 1679 states and 2704 transitions. [2022-02-20 19:48:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:48:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:48:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-02-20 19:48:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-02-20 19:48:28,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1725 transitions. [2022-02-20 19:48:30,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1725 edges. 1725 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:30,572 INFO L225 Difference]: With dead ends: 1679 [2022-02-20 19:48:30,572 INFO L226 Difference]: Without dead ends: 1613 [2022-02-20 19:48:30,573 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:48:30,574 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 3 mSDsluCounter, 4820 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6441 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:30,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6441 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2022-02-20 19:48:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2022-02-20 19:48:30,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:30,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.590316573556797) internal successors, (2562), 1612 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:30,614 INFO L74 IsIncluded]: Start isIncluded. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.590316573556797) internal successors, (2562), 1612 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:30,616 INFO L87 Difference]: Start difference. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.590316573556797) internal successors, (2562), 1612 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:30,738 INFO L93 Difference]: Finished difference Result 1613 states and 2562 transitions. [2022-02-20 19:48:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2562 transitions. [2022-02-20 19:48:30,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:30,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:30,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 1613 states, 1611 states have (on average 1.590316573556797) internal successors, (2562), 1612 states have internal predecessors, (2562), 0 states have call successors, (0), 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 1613 states. [2022-02-20 19:48:30,747 INFO L87 Difference]: Start difference. First operand has 1613 states, 1611 states have (on average 1.590316573556797) internal successors, (2562), 1612 states have internal predecessors, (2562), 0 states have call successors, (0), 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 1613 states. [2022-02-20 19:48:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:30,867 INFO L93 Difference]: Finished difference Result 1613 states and 2562 transitions. [2022-02-20 19:48:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2562 transitions. [2022-02-20 19:48:30,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:30,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:30,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:30,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1611 states have (on average 1.590316573556797) internal successors, (2562), 1612 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2562 transitions. [2022-02-20 19:48:30,996 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2562 transitions. Word has length 38 [2022-02-20 19:48:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:30,996 INFO L470 AbstractCegarLoop]: Abstraction has 1613 states and 2562 transitions. [2022-02-20 19:48:30,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2562 transitions. [2022-02-20 19:48:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:31,000 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:31,001 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] [2022-02-20 19:48:31,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:48:31,001 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1531755293, now seen corresponding path program 1 times [2022-02-20 19:48:31,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:31,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161688597] [2022-02-20 19:48:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:31,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {14991#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;~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; {14991#true} is VALID [2022-02-20 19:48:31,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {14991#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {14991#true} is VALID [2022-02-20 19:48:31,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {14991#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret36#1, main1_#t~ret37#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~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14991#true} is VALID [2022-02-20 19:48:31,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {14991#true} assume 0 == ~r1~0 % 256; {14991#true} is VALID [2022-02-20 19:48:31,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {14991#true} assume ~id1~0 >= 0; {14991#true} is VALID [2022-02-20 19:48:31,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {14991#true} assume 0 == ~st1~0; {14991#true} is VALID [2022-02-20 19:48:31,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {14991#true} assume ~send1~0 == ~id1~0; {14991#true} is VALID [2022-02-20 19:48:31,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {14991#true} assume 0 == ~mode1~0 % 256; {14991#true} is VALID [2022-02-20 19:48:31,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {14991#true} assume ~id2~0 >= 0; {14991#true} is VALID [2022-02-20 19:48:31,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {14991#true} assume 0 == ~st2~0; {14991#true} is VALID [2022-02-20 19:48:31,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {14991#true} assume ~send2~0 == ~id2~0; {14991#true} is VALID [2022-02-20 19:48:31,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {14991#true} assume 0 == ~mode2~0 % 256; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {14993#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14992#false} is VALID [2022-02-20 19:48:31,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {14992#false} assume !(node2_~m2~0#1 != ~nomsg~0); {14992#false} is VALID [2022-02-20 19:48:31,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {14992#false} ~mode2~0 := 0; {14992#false} is VALID [2022-02-20 19:48:31,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {14992#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; {14992#false} is VALID [2022-02-20 19:48:31,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {14992#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14992#false} is VALID [2022-02-20 19:48:31,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {14992#false} assume !(node3_~m3~0#1 != ~nomsg~0); {14992#false} is VALID [2022-02-20 19:48:31,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {14992#false} ~mode3~0 := 0; {14992#false} is VALID [2022-02-20 19:48:31,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {14992#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; {14992#false} is VALID [2022-02-20 19:48:31,165 INFO L290 TraceCheckUtils]: 60: Hoare triple {14992#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14992#false} is VALID [2022-02-20 19:48:31,165 INFO L290 TraceCheckUtils]: 61: Hoare triple {14992#false} assume !(node4_~m4~0#1 != ~nomsg~0); {14992#false} is VALID [2022-02-20 19:48:31,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {14992#false} ~mode4~0 := 0; {14992#false} is VALID [2022-02-20 19:48:31,166 INFO L290 TraceCheckUtils]: 63: Hoare triple {14992#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; {14992#false} is VALID [2022-02-20 19:48:31,166 INFO L290 TraceCheckUtils]: 64: Hoare triple {14992#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {14992#false} is VALID [2022-02-20 19:48:31,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {14992#false} assume !(node5_~m5~0#1 != ~nomsg~0); {14992#false} is VALID [2022-02-20 19:48:31,166 INFO L290 TraceCheckUtils]: 66: Hoare triple {14992#false} ~mode5~0 := 0; {14992#false} is VALID [2022-02-20 19:48:31,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {14992#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; {14992#false} is VALID [2022-02-20 19:48:31,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {14992#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {14992#false} is VALID [2022-02-20 19:48:31,167 INFO L290 TraceCheckUtils]: 69: Hoare triple {14992#false} assume !(node6_~m6~0#1 != ~nomsg~0); {14992#false} is VALID [2022-02-20 19:48:31,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {14992#false} ~mode6~0 := 0; {14992#false} is VALID [2022-02-20 19:48:31,167 INFO L290 TraceCheckUtils]: 71: Hoare triple {14992#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14992#false} is VALID [2022-02-20 19:48:31,168 INFO L290 TraceCheckUtils]: 72: Hoare triple {14992#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {14992#false} is VALID [2022-02-20 19:48:31,168 INFO L290 TraceCheckUtils]: 73: Hoare triple {14992#false} check_#res#1 := check_~tmp~1#1; {14992#false} is VALID [2022-02-20 19:48:31,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {14992#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {14992#false} is VALID [2022-02-20 19:48:31,168 INFO L290 TraceCheckUtils]: 75: Hoare triple {14992#false} assume 0 == assert_~arg#1 % 256; {14992#false} is VALID [2022-02-20 19:48:31,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {14992#false} assume !false; {14992#false} is VALID [2022-02-20 19:48:31,169 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:48:31,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:31,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161688597] [2022-02-20 19:48:31,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161688597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:31,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:31,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:31,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979925201] [2022-02-20 19:48:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:31,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:31,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:31,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:31,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:31,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:31,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:31,222 INFO L87 Difference]: Start difference. First operand 1613 states and 2562 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:33,162 INFO L93 Difference]: Finished difference Result 1731 states and 2748 transitions. [2022-02-20 19:48:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:33,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:33,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:34,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:34,833 INFO L225 Difference]: With dead ends: 1731 [2022-02-20 19:48:34,833 INFO L226 Difference]: Without dead ends: 1669 [2022-02-20 19:48:34,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:34,835 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 1523 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:34,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1523 Valid, 1751 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2022-02-20 19:48:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2022-02-20 19:48:34,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:34,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.5903903903903904) internal successors, (2648), 1666 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:34,882 INFO L74 IsIncluded]: Start isIncluded. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.5903903903903904) internal successors, (2648), 1666 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:34,885 INFO L87 Difference]: Start difference. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.5903903903903904) internal successors, (2648), 1666 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:35,007 INFO L93 Difference]: Finished difference Result 1669 states and 2649 transitions. [2022-02-20 19:48:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2649 transitions. [2022-02-20 19:48:35,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:35,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:35,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 1667 states, 1665 states have (on average 1.5903903903903904) internal successors, (2648), 1666 states have internal predecessors, (2648), 0 states have call successors, (0), 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 1669 states. [2022-02-20 19:48:35,018 INFO L87 Difference]: Start difference. First operand has 1667 states, 1665 states have (on average 1.5903903903903904) internal successors, (2648), 1666 states have internal predecessors, (2648), 0 states have call successors, (0), 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 1669 states. [2022-02-20 19:48:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:35,144 INFO L93 Difference]: Finished difference Result 1669 states and 2649 transitions. [2022-02-20 19:48:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2649 transitions. [2022-02-20 19:48:35,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:35,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:35,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:35,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.5903903903903904) internal successors, (2648), 1666 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2648 transitions. [2022-02-20 19:48:35,284 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2648 transitions. Word has length 77 [2022-02-20 19:48:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:35,285 INFO L470 AbstractCegarLoop]: Abstraction has 1667 states and 2648 transitions. [2022-02-20 19:48:35,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2648 transitions. [2022-02-20 19:48:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:35,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:35,286 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] [2022-02-20 19:48:35,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:48:35,287 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:35,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash 786172563, now seen corresponding path program 1 times [2022-02-20 19:48:35,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:35,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691335194] [2022-02-20 19:48:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:35,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {21799#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;~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; {21799#true} is VALID [2022-02-20 19:48:35,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {21799#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {21799#true} is VALID [2022-02-20 19:48:35,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {21799#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret36#1, main1_#t~ret37#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~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21799#true} is VALID [2022-02-20 19:48:35,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {21799#true} assume 0 == ~r1~0 % 256; {21799#true} is VALID [2022-02-20 19:48:35,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {21799#true} assume ~id1~0 >= 0; {21799#true} is VALID [2022-02-20 19:48:35,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {21799#true} assume 0 == ~st1~0; {21799#true} is VALID [2022-02-20 19:48:35,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {21799#true} assume ~send1~0 == ~id1~0; {21799#true} is VALID [2022-02-20 19:48:35,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {21799#true} assume 0 == ~mode1~0 % 256; {21799#true} is VALID [2022-02-20 19:48:35,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {21799#true} assume ~id2~0 >= 0; {21799#true} is VALID [2022-02-20 19:48:35,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {21799#true} assume 0 == ~st2~0; {21799#true} is VALID [2022-02-20 19:48:35,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {21799#true} assume ~send2~0 == ~id2~0; {21799#true} is VALID [2022-02-20 19:48:35,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {21799#true} assume 0 == ~mode2~0 % 256; {21799#true} is VALID [2022-02-20 19:48:35,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {21799#true} assume ~id3~0 >= 0; {21799#true} is VALID [2022-02-20 19:48:35,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {21799#true} assume 0 == ~st3~0; {21799#true} is VALID [2022-02-20 19:48:35,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {21799#true} assume ~send3~0 == ~id3~0; {21799#true} is VALID [2022-02-20 19:48:35,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {21799#true} assume 0 == ~mode3~0 % 256; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {21801#(= (+ (* (- 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;main1_~i2~0#1 := 0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {21801#(= (+ (* (- 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; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {21801#(= (+ (* (- 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; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {21801#(= (+ (* (- 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; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {21801#(= (+ (* (- 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; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {21801#(= (+ (* (- 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; {21801#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {21801#(= (+ (* (- 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; {21800#false} is VALID [2022-02-20 19:48:35,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {21800#false} assume !(node3_~m3~0#1 != ~nomsg~0); {21800#false} is VALID [2022-02-20 19:48:35,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {21800#false} ~mode3~0 := 0; {21800#false} is VALID [2022-02-20 19:48:35,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {21800#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; {21800#false} is VALID [2022-02-20 19:48:35,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {21800#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21800#false} is VALID [2022-02-20 19:48:35,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {21800#false} assume !(node4_~m4~0#1 != ~nomsg~0); {21800#false} is VALID [2022-02-20 19:48:35,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {21800#false} ~mode4~0 := 0; {21800#false} is VALID [2022-02-20 19:48:35,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {21800#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; {21800#false} is VALID [2022-02-20 19:48:35,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {21800#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21800#false} is VALID [2022-02-20 19:48:35,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {21800#false} assume !(node5_~m5~0#1 != ~nomsg~0); {21800#false} is VALID [2022-02-20 19:48:35,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {21800#false} ~mode5~0 := 0; {21800#false} is VALID [2022-02-20 19:48:35,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {21800#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; {21800#false} is VALID [2022-02-20 19:48:35,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {21800#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {21800#false} is VALID [2022-02-20 19:48:35,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {21800#false} assume !(node6_~m6~0#1 != ~nomsg~0); {21800#false} is VALID [2022-02-20 19:48:35,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {21800#false} ~mode6~0 := 0; {21800#false} is VALID [2022-02-20 19:48:35,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {21800#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21800#false} is VALID [2022-02-20 19:48:35,409 INFO L290 TraceCheckUtils]: 72: Hoare triple {21800#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {21800#false} is VALID [2022-02-20 19:48:35,409 INFO L290 TraceCheckUtils]: 73: Hoare triple {21800#false} check_#res#1 := check_~tmp~1#1; {21800#false} is VALID [2022-02-20 19:48:35,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {21800#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {21800#false} is VALID [2022-02-20 19:48:35,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {21800#false} assume 0 == assert_~arg#1 % 256; {21800#false} is VALID [2022-02-20 19:48:35,409 INFO L290 TraceCheckUtils]: 76: Hoare triple {21800#false} assume !false; {21800#false} is VALID [2022-02-20 19:48:35,411 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:48:35,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:35,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691335194] [2022-02-20 19:48:35,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691335194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:35,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:35,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:35,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183058322] [2022-02-20 19:48:35,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:35,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:35,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:35,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:35,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:35,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:35,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:35,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:35,479 INFO L87 Difference]: Start difference. First operand 1667 states and 2648 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:37,304 INFO L93 Difference]: Finished difference Result 1887 states and 2996 transitions. [2022-02-20 19:48:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:37,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:37,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:38,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:38,929 INFO L225 Difference]: With dead ends: 1887 [2022-02-20 19:48:38,930 INFO L226 Difference]: Without dead ends: 1771 [2022-02-20 19:48:38,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:38,931 INFO L933 BasicCegarLoop]: 1646 mSDtfsCounter, 1519 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:38,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1519 Valid, 1750 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-02-20 19:48:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1769. [2022-02-20 19:48:38,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:38,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.5897000565930957) internal successors, (2809), 1768 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:38,990 INFO L74 IsIncluded]: Start isIncluded. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.5897000565930957) internal successors, (2809), 1768 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:38,992 INFO L87 Difference]: Start difference. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.5897000565930957) internal successors, (2809), 1768 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:39,110 INFO L93 Difference]: Finished difference Result 1771 states and 2810 transitions. [2022-02-20 19:48:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2810 transitions. [2022-02-20 19:48:39,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:39,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:39,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 1769 states, 1767 states have (on average 1.5897000565930957) internal successors, (2809), 1768 states have internal predecessors, (2809), 0 states have call successors, (0), 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 1771 states. [2022-02-20 19:48:39,117 INFO L87 Difference]: Start difference. First operand has 1769 states, 1767 states have (on average 1.5897000565930957) internal successors, (2809), 1768 states have internal predecessors, (2809), 0 states have call successors, (0), 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 1771 states. [2022-02-20 19:48:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:39,218 INFO L93 Difference]: Finished difference Result 1771 states and 2810 transitions. [2022-02-20 19:48:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2810 transitions. [2022-02-20 19:48:39,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:39,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:39,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:39,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1767 states have (on average 1.5897000565930957) internal successors, (2809), 1768 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2809 transitions. [2022-02-20 19:48:39,337 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2809 transitions. Word has length 77 [2022-02-20 19:48:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:39,338 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 2809 transitions. [2022-02-20 19:48:39,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2809 transitions. [2022-02-20 19:48:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:39,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:39,339 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] [2022-02-20 19:48:39,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:48:39,340 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1153858295, now seen corresponding path program 1 times [2022-02-20 19:48:39,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:39,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845488148] [2022-02-20 19:48:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:39,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:39,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {29114#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;~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; {29114#true} is VALID [2022-02-20 19:48:39,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {29114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {29114#true} is VALID [2022-02-20 19:48:39,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {29114#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret36#1, main1_#t~ret37#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~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29114#true} is VALID [2022-02-20 19:48:39,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {29114#true} assume 0 == ~r1~0 % 256; {29114#true} is VALID [2022-02-20 19:48:39,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {29114#true} assume ~id1~0 >= 0; {29114#true} is VALID [2022-02-20 19:48:39,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {29114#true} assume 0 == ~st1~0; {29114#true} is VALID [2022-02-20 19:48:39,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {29114#true} assume ~send1~0 == ~id1~0; {29114#true} is VALID [2022-02-20 19:48:39,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {29114#true} assume 0 == ~mode1~0 % 256; {29114#true} is VALID [2022-02-20 19:48:39,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {29114#true} assume ~id2~0 >= 0; {29114#true} is VALID [2022-02-20 19:48:39,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {29114#true} assume 0 == ~st2~0; {29114#true} is VALID [2022-02-20 19:48:39,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {29114#true} assume ~send2~0 == ~id2~0; {29114#true} is VALID [2022-02-20 19:48:39,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {29114#true} assume 0 == ~mode2~0 % 256; {29114#true} is VALID [2022-02-20 19:48:39,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {29114#true} assume ~id3~0 >= 0; {29114#true} is VALID [2022-02-20 19:48:39,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {29114#true} assume 0 == ~st3~0; {29114#true} is VALID [2022-02-20 19:48:39,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {29114#true} assume ~send3~0 == ~id3~0; {29114#true} is VALID [2022-02-20 19:48:39,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {29114#true} assume 0 == ~mode3~0 % 256; {29114#true} is VALID [2022-02-20 19:48:39,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {29114#true} assume ~id4~0 >= 0; {29114#true} is VALID [2022-02-20 19:48:39,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {29114#true} assume 0 == ~st4~0; {29114#true} is VALID [2022-02-20 19:48:39,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {29114#true} assume ~send4~0 == ~id4~0; {29114#true} is VALID [2022-02-20 19:48:39,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {29114#true} assume 0 == ~mode4~0 % 256; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,424 INFO L290 TraceCheckUtils]: 51: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,426 INFO L290 TraceCheckUtils]: 55: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {29116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29115#false} is VALID [2022-02-20 19:48:39,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {29115#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29115#false} is VALID [2022-02-20 19:48:39,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {29115#false} ~mode4~0 := 0; {29115#false} is VALID [2022-02-20 19:48:39,429 INFO L290 TraceCheckUtils]: 63: Hoare triple {29115#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; {29115#false} is VALID [2022-02-20 19:48:39,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {29115#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29115#false} is VALID [2022-02-20 19:48:39,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {29115#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29115#false} is VALID [2022-02-20 19:48:39,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {29115#false} ~mode5~0 := 0; {29115#false} is VALID [2022-02-20 19:48:39,429 INFO L290 TraceCheckUtils]: 67: Hoare triple {29115#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; {29115#false} is VALID [2022-02-20 19:48:39,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {29115#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {29115#false} is VALID [2022-02-20 19:48:39,430 INFO L290 TraceCheckUtils]: 69: Hoare triple {29115#false} assume !(node6_~m6~0#1 != ~nomsg~0); {29115#false} is VALID [2022-02-20 19:48:39,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {29115#false} ~mode6~0 := 0; {29115#false} is VALID [2022-02-20 19:48:39,430 INFO L290 TraceCheckUtils]: 71: Hoare triple {29115#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29115#false} is VALID [2022-02-20 19:48:39,430 INFO L290 TraceCheckUtils]: 72: Hoare triple {29115#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {29115#false} is VALID [2022-02-20 19:48:39,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {29115#false} check_#res#1 := check_~tmp~1#1; {29115#false} is VALID [2022-02-20 19:48:39,431 INFO L290 TraceCheckUtils]: 74: Hoare triple {29115#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {29115#false} is VALID [2022-02-20 19:48:39,431 INFO L290 TraceCheckUtils]: 75: Hoare triple {29115#false} assume 0 == assert_~arg#1 % 256; {29115#false} is VALID [2022-02-20 19:48:39,431 INFO L290 TraceCheckUtils]: 76: Hoare triple {29115#false} assume !false; {29115#false} is VALID [2022-02-20 19:48:39,432 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:48:39,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:39,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845488148] [2022-02-20 19:48:39,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845488148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:39,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:39,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:39,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495386940] [2022-02-20 19:48:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:39,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:39,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:39,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:39,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:39,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:39,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:39,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:39,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:39,487 INFO L87 Difference]: Start difference. First operand 1769 states and 2809 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:41,363 INFO L93 Difference]: Finished difference Result 2181 states and 3459 transitions. [2022-02-20 19:48:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:41,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:42,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:43,015 INFO L225 Difference]: With dead ends: 2181 [2022-02-20 19:48:43,015 INFO L226 Difference]: Without dead ends: 1963 [2022-02-20 19:48:43,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:43,017 INFO L933 BasicCegarLoop]: 1641 mSDtfsCounter, 1515 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:43,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-02-20 19:48:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1961. [2022-02-20 19:48:43,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:43,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.5870342011230218) internal successors, (3109), 1960 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:43,088 INFO L74 IsIncluded]: Start isIncluded. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.5870342011230218) internal successors, (3109), 1960 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:43,090 INFO L87 Difference]: Start difference. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.5870342011230218) internal successors, (3109), 1960 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:43,244 INFO L93 Difference]: Finished difference Result 1963 states and 3110 transitions. [2022-02-20 19:48:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3110 transitions. [2022-02-20 19:48:43,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:43,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:43,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 1961 states, 1959 states have (on average 1.5870342011230218) internal successors, (3109), 1960 states have internal predecessors, (3109), 0 states have call successors, (0), 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 1963 states. [2022-02-20 19:48:43,252 INFO L87 Difference]: Start difference. First operand has 1961 states, 1959 states have (on average 1.5870342011230218) internal successors, (3109), 1960 states have internal predecessors, (3109), 0 states have call successors, (0), 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 1963 states. [2022-02-20 19:48:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:43,416 INFO L93 Difference]: Finished difference Result 1963 states and 3110 transitions. [2022-02-20 19:48:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3110 transitions. [2022-02-20 19:48:43,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:43,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:43,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:43,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1959 states have (on average 1.5870342011230218) internal successors, (3109), 1960 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3109 transitions. [2022-02-20 19:48:43,545 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3109 transitions. Word has length 77 [2022-02-20 19:48:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:43,545 INFO L470 AbstractCegarLoop]: Abstraction has 1961 states and 3109 transitions. [2022-02-20 19:48:43,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3109 transitions. [2022-02-20 19:48:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:43,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:43,546 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] [2022-02-20 19:48:43,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:48:43,546 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:43,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:43,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1546824319, now seen corresponding path program 1 times [2022-02-20 19:48:43,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:43,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306504192] [2022-02-20 19:48:43,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:43,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:43,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {37389#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;~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; {37389#true} is VALID [2022-02-20 19:48:43,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {37389#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {37389#true} is VALID [2022-02-20 19:48:43,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {37389#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret36#1, main1_#t~ret37#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~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {37389#true} is VALID [2022-02-20 19:48:43,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {37389#true} assume 0 == ~r1~0 % 256; {37389#true} is VALID [2022-02-20 19:48:43,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {37389#true} assume ~id1~0 >= 0; {37389#true} is VALID [2022-02-20 19:48:43,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {37389#true} assume 0 == ~st1~0; {37389#true} is VALID [2022-02-20 19:48:43,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {37389#true} assume ~send1~0 == ~id1~0; {37389#true} is VALID [2022-02-20 19:48:43,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {37389#true} assume 0 == ~mode1~0 % 256; {37389#true} is VALID [2022-02-20 19:48:43,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {37389#true} assume ~id2~0 >= 0; {37389#true} is VALID [2022-02-20 19:48:43,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {37389#true} assume 0 == ~st2~0; {37389#true} is VALID [2022-02-20 19:48:43,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {37389#true} assume ~send2~0 == ~id2~0; {37389#true} is VALID [2022-02-20 19:48:43,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {37389#true} assume 0 == ~mode2~0 % 256; {37389#true} is VALID [2022-02-20 19:48:43,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {37389#true} assume ~id3~0 >= 0; {37389#true} is VALID [2022-02-20 19:48:43,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {37389#true} assume 0 == ~st3~0; {37389#true} is VALID [2022-02-20 19:48:43,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {37389#true} assume ~send3~0 == ~id3~0; {37389#true} is VALID [2022-02-20 19:48:43,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {37389#true} assume 0 == ~mode3~0 % 256; {37389#true} is VALID [2022-02-20 19:48:43,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {37389#true} assume ~id4~0 >= 0; {37389#true} is VALID [2022-02-20 19:48:43,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {37389#true} assume 0 == ~st4~0; {37389#true} is VALID [2022-02-20 19:48:43,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {37389#true} assume ~send4~0 == ~id4~0; {37389#true} is VALID [2022-02-20 19:48:43,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {37389#true} assume 0 == ~mode4~0 % 256; {37389#true} is VALID [2022-02-20 19:48:43,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {37389#true} assume ~id5~0 >= 0; {37389#true} is VALID [2022-02-20 19:48:43,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {37389#true} assume 0 == ~st5~0; {37389#true} is VALID [2022-02-20 19:48:43,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {37389#true} assume ~send5~0 == ~id5~0; {37389#true} is VALID [2022-02-20 19:48:43,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {37389#true} assume 0 == ~mode5~0 % 256; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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;main1_~i2~0#1 := 0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,650 INFO L290 TraceCheckUtils]: 57: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} 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; {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,653 INFO L290 TraceCheckUtils]: 64: Hoare triple {37391#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {37390#false} is VALID [2022-02-20 19:48:43,653 INFO L290 TraceCheckUtils]: 65: Hoare triple {37390#false} assume !(node5_~m5~0#1 != ~nomsg~0); {37390#false} is VALID [2022-02-20 19:48:43,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {37390#false} ~mode5~0 := 0; {37390#false} is VALID [2022-02-20 19:48:43,654 INFO L290 TraceCheckUtils]: 67: Hoare triple {37390#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; {37390#false} is VALID [2022-02-20 19:48:43,654 INFO L290 TraceCheckUtils]: 68: Hoare triple {37390#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {37390#false} is VALID [2022-02-20 19:48:43,654 INFO L290 TraceCheckUtils]: 69: Hoare triple {37390#false} assume !(node6_~m6~0#1 != ~nomsg~0); {37390#false} is VALID [2022-02-20 19:48:43,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {37390#false} ~mode6~0 := 0; {37390#false} is VALID [2022-02-20 19:48:43,654 INFO L290 TraceCheckUtils]: 71: Hoare triple {37390#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {37390#false} is VALID [2022-02-20 19:48:43,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {37390#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {37390#false} is VALID [2022-02-20 19:48:43,655 INFO L290 TraceCheckUtils]: 73: Hoare triple {37390#false} check_#res#1 := check_~tmp~1#1; {37390#false} is VALID [2022-02-20 19:48:43,655 INFO L290 TraceCheckUtils]: 74: Hoare triple {37390#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {37390#false} is VALID [2022-02-20 19:48:43,655 INFO L290 TraceCheckUtils]: 75: Hoare triple {37390#false} assume 0 == assert_~arg#1 % 256; {37390#false} is VALID [2022-02-20 19:48:43,655 INFO L290 TraceCheckUtils]: 76: Hoare triple {37390#false} assume !false; {37390#false} is VALID [2022-02-20 19:48:43,655 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:48:43,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:43,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306504192] [2022-02-20 19:48:43,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306504192] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:43,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:43,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:43,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294160297] [2022-02-20 19:48:43,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:43,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:43,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:43,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:43,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:43,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:43,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:43,732 INFO L87 Difference]: Start difference. First operand 1961 states and 3109 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:45,792 INFO L93 Difference]: Finished difference Result 2733 states and 4319 transitions. [2022-02-20 19:48:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:45,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:45,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:47,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:47,456 INFO L225 Difference]: With dead ends: 2733 [2022-02-20 19:48:47,456 INFO L226 Difference]: Without dead ends: 2323 [2022-02-20 19:48:47,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:47,458 INFO L933 BasicCegarLoop]: 1636 mSDtfsCounter, 1511 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:47,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1748 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2022-02-20 19:48:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2321. [2022-02-20 19:48:47,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:47,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.5804225959465288) internal successors, (3665), 2320 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:47,586 INFO L74 IsIncluded]: Start isIncluded. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.5804225959465288) internal successors, (3665), 2320 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:47,589 INFO L87 Difference]: Start difference. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.5804225959465288) internal successors, (3665), 2320 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:47,808 INFO L93 Difference]: Finished difference Result 2323 states and 3666 transitions. [2022-02-20 19:48:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3666 transitions. [2022-02-20 19:48:47,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:47,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:47,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 2321 states, 2319 states have (on average 1.5804225959465288) internal successors, (3665), 2320 states have internal predecessors, (3665), 0 states have call successors, (0), 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 2323 states. [2022-02-20 19:48:47,819 INFO L87 Difference]: Start difference. First operand has 2321 states, 2319 states have (on average 1.5804225959465288) internal successors, (3665), 2320 states have internal predecessors, (3665), 0 states have call successors, (0), 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 2323 states. [2022-02-20 19:48:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:47,984 INFO L93 Difference]: Finished difference Result 2323 states and 3666 transitions. [2022-02-20 19:48:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3666 transitions. [2022-02-20 19:48:47,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:47,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:47,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:47,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2319 states have (on average 1.5804225959465288) internal successors, (3665), 2320 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3665 transitions. [2022-02-20 19:48:48,157 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3665 transitions. Word has length 77 [2022-02-20 19:48:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:48,157 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 3665 transitions. [2022-02-20 19:48:48,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3665 transitions. [2022-02-20 19:48:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:48,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:48,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:48,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:48:48,159 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1884617461, now seen corresponding path program 1 times [2022-02-20 19:48:48,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:48,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156971721] [2022-02-20 19:48:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:48,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {47476#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;~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; {47476#true} is VALID [2022-02-20 19:48:48,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {47476#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {47476#true} is VALID [2022-02-20 19:48:48,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {47476#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret36#1, main1_#t~ret37#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~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {47476#true} is VALID [2022-02-20 19:48:48,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {47476#true} assume 0 == ~r1~0 % 256; {47476#true} is VALID [2022-02-20 19:48:48,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {47476#true} assume ~id1~0 >= 0; {47476#true} is VALID [2022-02-20 19:48:48,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {47476#true} assume 0 == ~st1~0; {47476#true} is VALID [2022-02-20 19:48:48,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {47476#true} assume ~send1~0 == ~id1~0; {47476#true} is VALID [2022-02-20 19:48:48,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {47476#true} assume 0 == ~mode1~0 % 256; {47476#true} is VALID [2022-02-20 19:48:48,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {47476#true} assume ~id2~0 >= 0; {47476#true} is VALID [2022-02-20 19:48:48,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {47476#true} assume 0 == ~st2~0; {47476#true} is VALID [2022-02-20 19:48:48,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {47476#true} assume ~send2~0 == ~id2~0; {47476#true} is VALID [2022-02-20 19:48:48,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {47476#true} assume 0 == ~mode2~0 % 256; {47476#true} is VALID [2022-02-20 19:48:48,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {47476#true} assume ~id3~0 >= 0; {47476#true} is VALID [2022-02-20 19:48:48,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {47476#true} assume 0 == ~st3~0; {47476#true} is VALID [2022-02-20 19:48:48,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {47476#true} assume ~send3~0 == ~id3~0; {47476#true} is VALID [2022-02-20 19:48:48,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {47476#true} assume 0 == ~mode3~0 % 256; {47476#true} is VALID [2022-02-20 19:48:48,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {47476#true} assume ~id4~0 >= 0; {47476#true} is VALID [2022-02-20 19:48:48,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {47476#true} assume 0 == ~st4~0; {47476#true} is VALID [2022-02-20 19:48:48,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {47476#true} assume ~send4~0 == ~id4~0; {47476#true} is VALID [2022-02-20 19:48:48,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {47476#true} assume 0 == ~mode4~0 % 256; {47476#true} is VALID [2022-02-20 19:48:48,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {47476#true} assume ~id5~0 >= 0; {47476#true} is VALID [2022-02-20 19:48:48,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {47476#true} assume 0 == ~st5~0; {47476#true} is VALID [2022-02-20 19:48:48,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {47476#true} assume ~send5~0 == ~id5~0; {47476#true} is VALID [2022-02-20 19:48:48,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {47476#true} assume 0 == ~mode5~0 % 256; {47476#true} is VALID [2022-02-20 19:48:48,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {47476#true} assume ~id6~0 >= 0; {47476#true} is VALID [2022-02-20 19:48:48,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {47476#true} assume 0 == ~st6~0; {47476#true} is VALID [2022-02-20 19:48:48,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {47476#true} assume ~send6~0 == ~id6~0; {47476#true} is VALID [2022-02-20 19:48:48,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {47476#true} assume 0 == ~mode6~0 % 256; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,277 INFO L290 TraceCheckUtils]: 44: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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;main1_~i2~0#1 := 0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,285 INFO L290 TraceCheckUtils]: 59: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,285 INFO L290 TraceCheckUtils]: 60: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,286 INFO L290 TraceCheckUtils]: 61: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} 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; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,288 INFO L290 TraceCheckUtils]: 65: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,288 INFO L290 TraceCheckUtils]: 66: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} 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; {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:48,289 INFO L290 TraceCheckUtils]: 68: Hoare triple {47478#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {47477#false} is VALID [2022-02-20 19:48:48,289 INFO L290 TraceCheckUtils]: 69: Hoare triple {47477#false} assume !(node6_~m6~0#1 != ~nomsg~0); {47477#false} is VALID [2022-02-20 19:48:48,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {47477#false} ~mode6~0 := 0; {47477#false} is VALID [2022-02-20 19:48:48,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {47477#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {47477#false} is VALID [2022-02-20 19:48:48,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {47477#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {47477#false} is VALID [2022-02-20 19:48:48,290 INFO L290 TraceCheckUtils]: 73: Hoare triple {47477#false} check_#res#1 := check_~tmp~1#1; {47477#false} is VALID [2022-02-20 19:48:48,290 INFO L290 TraceCheckUtils]: 74: Hoare triple {47477#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {47477#false} is VALID [2022-02-20 19:48:48,290 INFO L290 TraceCheckUtils]: 75: Hoare triple {47477#false} assume 0 == assert_~arg#1 % 256; {47477#false} is VALID [2022-02-20 19:48:48,291 INFO L290 TraceCheckUtils]: 76: Hoare triple {47477#false} assume !false; {47477#false} is VALID [2022-02-20 19:48:48,291 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:48:48,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:48,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156971721] [2022-02-20 19:48:48,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156971721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:48,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:48,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:48,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589855103] [2022-02-20 19:48:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:48,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:48,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:48,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:48,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:48,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:48,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:48,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:48,344 INFO L87 Difference]: Start difference. First operand 2321 states and 3665 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:50,718 INFO L93 Difference]: Finished difference Result 3765 states and 5907 transitions. [2022-02-20 19:48:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:50,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:50,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:52,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:52,493 INFO L225 Difference]: With dead ends: 3765 [2022-02-20 19:48:52,493 INFO L226 Difference]: Without dead ends: 2995 [2022-02-20 19:48:52,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:52,495 INFO L933 BasicCegarLoop]: 1631 mSDtfsCounter, 1507 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:52,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1747 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2022-02-20 19:48:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2993. [2022-02-20 19:48:52,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:52,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.5677031093279838) internal successors, (4689), 2992 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:52,717 INFO L74 IsIncluded]: Start isIncluded. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.5677031093279838) internal successors, (4689), 2992 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:52,722 INFO L87 Difference]: Start difference. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.5677031093279838) internal successors, (4689), 2992 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:52,995 INFO L93 Difference]: Finished difference Result 2995 states and 4690 transitions. [2022-02-20 19:48:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4690 transitions. [2022-02-20 19:48:52,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:52,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:53,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 2993 states, 2991 states have (on average 1.5677031093279838) internal successors, (4689), 2992 states have internal predecessors, (4689), 0 states have call successors, (0), 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 2995 states. [2022-02-20 19:48:53,006 INFO L87 Difference]: Start difference. First operand has 2993 states, 2991 states have (on average 1.5677031093279838) internal successors, (4689), 2992 states have internal predecessors, (4689), 0 states have call successors, (0), 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 2995 states. [2022-02-20 19:48:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:53,307 INFO L93 Difference]: Finished difference Result 2995 states and 4690 transitions. [2022-02-20 19:48:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4690 transitions. [2022-02-20 19:48:53,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:53,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:53,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:53,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2991 states have (on average 1.5677031093279838) internal successors, (4689), 2992 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4689 transitions. [2022-02-20 19:48:53,631 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4689 transitions. Word has length 77 [2022-02-20 19:48:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:53,631 INFO L470 AbstractCegarLoop]: Abstraction has 2993 states and 4689 transitions. [2022-02-20 19:48:53,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4689 transitions. [2022-02-20 19:48:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:53,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:53,632 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] [2022-02-20 19:48:53,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:48:53,632 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:53,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:53,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2001711063, now seen corresponding path program 1 times [2022-02-20 19:48:53,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:53,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195957114] [2022-02-20 19:48:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:53,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:53,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {60971#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;~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; {60971#true} is VALID [2022-02-20 19:48:53,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {60971#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {60971#true} is VALID [2022-02-20 19:48:53,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {60971#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~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~ret36#1, main1_#t~ret37#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~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {60971#true} is VALID [2022-02-20 19:48:53,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {60971#true} assume 0 == ~r1~0 % 256; {60971#true} is VALID [2022-02-20 19:48:53,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {60971#true} assume ~id1~0 >= 0; {60971#true} is VALID [2022-02-20 19:48:53,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {60971#true} assume 0 == ~st1~0; {60973#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:53,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {60973#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {60973#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:53,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {60973#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {60973#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:53,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {60973#(<= ~st1~0 0)} assume ~id2~0 >= 0; {60973#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:53,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {60973#(<= ~st1~0 0)} assume 0 == ~st2~0; {60974#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {60974#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {60974#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {60974#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {60974#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {60974#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {60974#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {60974#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {60975#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {60975#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {60975#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {60975#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {60975#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {60975#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {60975#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {60975#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {60976#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {60976#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {60976#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {60976#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {60976#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {60976#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {60976#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {60976#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {60977#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {60977#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {60977#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {60977#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {60977#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {60977#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {60977#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:53,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {60977#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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;main1_~i2~0#1 := 0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,755 INFO L290 TraceCheckUtils]: 48: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,756 INFO L290 TraceCheckUtils]: 50: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,758 INFO L290 TraceCheckUtils]: 55: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,761 INFO L290 TraceCheckUtils]: 61: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} 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; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,763 INFO L290 TraceCheckUtils]: 65: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,764 INFO L290 TraceCheckUtils]: 67: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} 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; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0);node6_#t~ite10#1 := ~p6_new~0; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,766 INFO L290 TraceCheckUtils]: 71: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {60978#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {60972#false} is VALID [2022-02-20 19:48:53,767 INFO L290 TraceCheckUtils]: 73: Hoare triple {60972#false} check_#res#1 := check_~tmp~1#1; {60972#false} is VALID [2022-02-20 19:48:53,767 INFO L290 TraceCheckUtils]: 74: Hoare triple {60972#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {60972#false} is VALID [2022-02-20 19:48:53,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {60972#false} assume 0 == assert_~arg#1 % 256; {60972#false} is VALID [2022-02-20 19:48:53,767 INFO L290 TraceCheckUtils]: 76: Hoare triple {60972#false} assume !false; {60972#false} is VALID [2022-02-20 19:48:53,768 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:48:53,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:53,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195957114] [2022-02-20 19:48:53,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195957114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:53,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:53,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:48:53,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202572058] [2022-02-20 19:48:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:53,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:53,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:53,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:53,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:53,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:48:53,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:53,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:48:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:48:53,825 INFO L87 Difference]: Start difference. First operand 2993 states and 4689 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)