./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ebc8d28b42c51bdeaffef49b8259d7ab2c7e002b024bef1fa6cab620a98975e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:48:04,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:48:04,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:48:04,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:48:04,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:48:04,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:48:04,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:48:04,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:48:04,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:48:04,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:48:04,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:48:04,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:48:04,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:48:04,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:48:04,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:48:04,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:48:04,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:48:04,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:48:04,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:48:04,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:48:04,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:48:04,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:48:04,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:48:04,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:48:04,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:48:04,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:48:04,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:48:04,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:48:04,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:48:04,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:48:04,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:48:04,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:48:04,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:48:04,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:48:04,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:48:04,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:48:05,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:48:05,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:48:05,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:48:05,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:48:05,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:48:05,002 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:05,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:48:05,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:48:05,026 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:48:05,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:48:05,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:48:05,027 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:48:05,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:48:05,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:48:05,028 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:48:05,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:48:05,029 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:48:05,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:48:05,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:48:05,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:48:05,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:48:05,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:48:05,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:48:05,030 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:48:05,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:48:05,030 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:48:05,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:48:05,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:48:05,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:48:05,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:48:05,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:48:05,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:48:05,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:48:05,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:48:05,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:48:05,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:48:05,032 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:48:05,032 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:48:05,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:48:05,032 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 -> 2ebc8d28b42c51bdeaffef49b8259d7ab2c7e002b024bef1fa6cab620a98975e [2022-02-20 19:48:05,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:48:05,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:48:05,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:48:05,246 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:48:05,247 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:48:05,248 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_label07.c [2022-02-20 19:48:05,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fe7f7db/1a13a58d5352412ba9ef01432870e109/FLAGc712616a0 [2022-02-20 19:48:05,861 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:48:05,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:48:05,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fe7f7db/1a13a58d5352412ba9ef01432870e109/FLAGc712616a0 [2022-02-20 19:48:06,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fe7f7db/1a13a58d5352412ba9ef01432870e109 [2022-02-20 19:48:06,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:48:06,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:48:06,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:48:06,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:48:06,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:48:06,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:48:06" (1/1) ... [2022-02-20 19:48:06,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fb40ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:06, skipping insertion in model container [2022-02-20 19:48:06,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:48:06" (1/1) ... [2022-02-20 19:48:06,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:48:06,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:48:06,496 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_label07.c[15510,15523] [2022-02-20 19:48:06,534 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_label07.c[16352,16365] [2022-02-20 19:48:07,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:48:07,143 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:48:07,176 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_label07.c[15510,15523] [2022-02-20 19:48:07,182 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_label07.c[16352,16365] [2022-02-20 19:48:07,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:48:07,573 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:48:07,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:07 WrapperNode [2022-02-20 19:48:07,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:48:07,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:48:07,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:48:07,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:48:07,578 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:07" (1/1) ... [2022-02-20 19:48:07,622 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:07" (1/1) ... [2022-02-20 19:48:07,879 INFO L137 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5147 [2022-02-20 19:48:07,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:48:07,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:48:07,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:48:07,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:48:07,886 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:07" (1/1) ... [2022-02-20 19:48:07,887 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:07" (1/1) ... [2022-02-20 19:48:07,909 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:07" (1/1) ... [2022-02-20 19:48:07,910 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:07" (1/1) ... [2022-02-20 19:48:08,077 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:07" (1/1) ... [2022-02-20 19:48:08,104 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:07" (1/1) ... [2022-02-20 19:48:08,121 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:07" (1/1) ... [2022-02-20 19:48:08,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:48:08,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:48:08,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:48:08,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:48:08,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:07" (1/1) ... [2022-02-20 19:48:08,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:48:08,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:48:08,185 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:08,215 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:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:48:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:48:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:48:08,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:48:08,383 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:48:08,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:48:15,305 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:48:15,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:48:15,315 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:48:15,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:48:15 BoogieIcfgContainer [2022-02-20 19:48:15,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:48:15,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:48:15,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:48:15,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:48:15,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:48:06" (1/3) ... [2022-02-20 19:48:15,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f4529e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:48:15, skipping insertion in model container [2022-02-20 19:48:15,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:07" (2/3) ... [2022-02-20 19:48:15,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f4529e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:48:15, skipping insertion in model container [2022-02-20 19:48:15,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:48:15" (3/3) ... [2022-02-20 19:48:15,323 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:48:15,326 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:48:15,326 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:48:15,358 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:48:15,362 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:15,363 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:48:15,388 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:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 19:48:15,391 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:15,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:48:15,392 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:15,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1999332245, now seen corresponding path program 1 times [2022-02-20 19:48:15,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:15,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082740622] [2022-02-20 19:48:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:15,526 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#(<= ~a7~0 13)} is VALID [2022-02-20 19:48:15,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {933#(<= ~a7~0 13)} 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#(<= ~a7~0 13)} is VALID [2022-02-20 19:48:15,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {933#(<= ~a7~0 13)} 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#(<= ~a7~0 13)} is VALID [2022-02-20 19:48:15,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {933#(<= ~a7~0 13)} 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#(<= ~a7~0 13)} is VALID [2022-02-20 19:48:15,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {933#(<= ~a7~0 13)} 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#(<= ~a7~0 13)} is VALID [2022-02-20 19:48:15,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {933#(<= ~a7~0 13)} assume (((14 == ~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:15,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {932#false} assume !false; {932#false} is VALID [2022-02-20 19:48:15,529 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:15,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:15,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082740622] [2022-02-20 19:48:15,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082740622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:15,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:15,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:48:15,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081249586] [2022-02-20 19:48:15,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:15,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 19:48:15,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:15,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:15,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:15,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:15,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:15,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:15,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:15,563 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:21,291 INFO L93 Difference]: Finished difference Result 2563 states and 4924 transitions. [2022-02-20 19:48:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:21,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 19:48:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4924 transitions. [2022-02-20 19:48:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4924 transitions. [2022-02-20 19:48:21,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4924 transitions. [2022-02-20 19:48:24,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4924 edges. 4924 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:24,933 INFO L225 Difference]: With dead ends: 2563 [2022-02-20 19:48:24,933 INFO L226 Difference]: Without dead ends: 1613 [2022-02-20 19:48:24,941 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:24,944 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1037 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:24,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 288 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-02-20 19:48:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2022-02-20 19:48:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2022-02-20 19:48:25,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:25,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.860955927995034) internal successors, (2998), 1612 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call 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:25,040 INFO L74 IsIncluded]: Start isIncluded. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.860955927995034) internal successors, (2998), 1612 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call 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:25,042 INFO L87 Difference]: Start difference. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.860955927995034) internal successors, (2998), 1612 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call 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:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:25,135 INFO L93 Difference]: Finished difference Result 1613 states and 2998 transitions. [2022-02-20 19:48:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2998 transitions. [2022-02-20 19:48:25,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:25,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:25,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 1613 states, 1611 states have (on average 1.860955927995034) internal successors, (2998), 1612 states have internal predecessors, (2998), 0 states have call successors, (0), 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:25,149 INFO L87 Difference]: Start difference. First operand has 1613 states, 1611 states have (on average 1.860955927995034) internal successors, (2998), 1612 states have internal predecessors, (2998), 0 states have call successors, (0), 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:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:25,248 INFO L93 Difference]: Finished difference Result 1613 states and 2998 transitions. [2022-02-20 19:48:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2998 transitions. [2022-02-20 19:48:25,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:25,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:25,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:25,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1611 states have (on average 1.860955927995034) internal successors, (2998), 1612 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call 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:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2998 transitions. [2022-02-20 19:48:25,350 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2998 transitions. Word has length 7 [2022-02-20 19:48:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:25,350 INFO L470 AbstractCegarLoop]: Abstraction has 1613 states and 2998 transitions. [2022-02-20 19:48:25,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2998 transitions. [2022-02-20 19:48:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:48:25,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:25,352 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:25,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:48:25,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash -46774319, now seen corresponding path program 1 times [2022-02-20 19:48:25,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:25,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771032057] [2022-02-20 19:48:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:25,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {8396#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; {8396#true} is VALID [2022-02-20 19:48:25,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {8396#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; {8396#true} is VALID [2022-02-20 19:48:25,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {8396#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; {8396#true} is VALID [2022-02-20 19:48:25,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {8396#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8398#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:48:25,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {8398#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8399#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:48:25,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {8399#(= |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; {8400#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:48:25,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {8400#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8397#false} is VALID [2022-02-20 19:48:25,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {8397#false} assume !(0 != ~mode1~0 % 256); {8397#false} is VALID [2022-02-20 19:48:25,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {8397#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8397#false} is VALID [2022-02-20 19:48:25,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {8397#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8397#false} is VALID [2022-02-20 19:48:25,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {8397#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8397#false} is VALID [2022-02-20 19:48:25,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {8397#false} ~mode2~0 := 0; {8397#false} is VALID [2022-02-20 19:48:25,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {8397#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8397#false} is VALID [2022-02-20 19:48:25,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {8397#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8397#false} is VALID [2022-02-20 19:48:25,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {8397#false} ~mode3~0 := 0; {8397#false} is VALID [2022-02-20 19:48:25,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {8397#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8397#false} is VALID [2022-02-20 19:48:25,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {8397#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8397#false} is VALID [2022-02-20 19:48:25,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {8397#false} ~mode4~0 := 0; {8397#false} is VALID [2022-02-20 19:48:25,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {8397#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8397#false} is VALID [2022-02-20 19:48:25,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {8397#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8397#false} is VALID [2022-02-20 19:48:25,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {8397#false} ~mode5~0 := 0; {8397#false} is VALID [2022-02-20 19:48:25,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {8397#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8397#false} is VALID [2022-02-20 19:48:25,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {8397#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8397#false} is VALID [2022-02-20 19:48:25,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {8397#false} ~mode6~0 := 0; {8397#false} is VALID [2022-02-20 19:48:25,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {8397#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {8397#false} is VALID [2022-02-20 19:48:25,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {8397#false} check_#res#1 := check_~tmp~1#1; {8397#false} is VALID [2022-02-20 19:48:25,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {8397#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; {8397#false} is VALID [2022-02-20 19:48:25,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {8397#false} assume 0 == assert_~arg#1 % 256; {8397#false} is VALID [2022-02-20 19:48:25,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {8397#false} assume !false; {8397#false} is VALID [2022-02-20 19:48:25,479 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:25,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:25,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771032057] [2022-02-20 19:48:25,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771032057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:25,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:25,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:48:25,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457522897] [2022-02-20 19:48:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:25,482 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:25,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:25,483 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:25,505 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:25,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:48:25,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:25,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:48:25,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:48:25,508 INFO L87 Difference]: Start difference. First operand 1613 states and 2998 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:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:29,639 INFO L93 Difference]: Finished difference Result 1679 states and 3100 transitions. [2022-02-20 19:48:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:48:29,639 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:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:29,639 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:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-02-20 19:48:29,648 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:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-02-20 19:48:29,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1725 transitions. [2022-02-20 19:48:30,983 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:31,062 INFO L225 Difference]: With dead ends: 1679 [2022-02-20 19:48:31,063 INFO L226 Difference]: Without dead ends: 1613 [2022-02-20 19:48:31,065 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:31,066 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:31,066 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:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2022-02-20 19:48:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2022-02-20 19:48:31,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:31,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.8361266294227188) internal successors, (2958), 1612 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call 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,092 INFO L74 IsIncluded]: Start isIncluded. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.8361266294227188) internal successors, (2958), 1612 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call 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,094 INFO L87 Difference]: Start difference. First operand 1613 states. Second operand has 1613 states, 1611 states have (on average 1.8361266294227188) internal successors, (2958), 1612 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call 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,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:31,177 INFO L93 Difference]: Finished difference Result 1613 states and 2958 transitions. [2022-02-20 19:48:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2958 transitions. [2022-02-20 19:48:31,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:31,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:31,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 1613 states, 1611 states have (on average 1.8361266294227188) internal successors, (2958), 1612 states have internal predecessors, (2958), 0 states have call successors, (0), 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:31,182 INFO L87 Difference]: Start difference. First operand has 1613 states, 1611 states have (on average 1.8361266294227188) internal successors, (2958), 1612 states have internal predecessors, (2958), 0 states have call successors, (0), 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:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:31,264 INFO L93 Difference]: Finished difference Result 1613 states and 2958 transitions. [2022-02-20 19:48:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2958 transitions. [2022-02-20 19:48:31,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:31,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:31,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:31,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1611 states have (on average 1.8361266294227188) internal successors, (2958), 1612 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call 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,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2958 transitions. [2022-02-20 19:48:31,360 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2958 transitions. Word has length 38 [2022-02-20 19:48:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:31,361 INFO L470 AbstractCegarLoop]: Abstraction has 1613 states and 2958 transitions. [2022-02-20 19:48:31,361 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:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2958 transitions. [2022-02-20 19:48:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:31,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:31,364 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,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:48:31,365 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1531755293, now seen corresponding path program 1 times [2022-02-20 19:48:31,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:31,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057341213] [2022-02-20 19:48:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:31,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {14975#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; {14975#true} is VALID [2022-02-20 19:48:31,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {14975#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; {14975#true} is VALID [2022-02-20 19:48:31,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {14975#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; {14975#true} is VALID [2022-02-20 19:48:31,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {14975#true} assume 0 == ~r1~0 % 256; {14975#true} is VALID [2022-02-20 19:48:31,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {14975#true} assume ~id1~0 >= 0; {14975#true} is VALID [2022-02-20 19:48:31,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {14975#true} assume 0 == ~st1~0; {14975#true} is VALID [2022-02-20 19:48:31,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {14975#true} assume ~send1~0 == ~id1~0; {14975#true} is VALID [2022-02-20 19:48:31,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {14975#true} assume 0 == ~mode1~0 % 256; {14975#true} is VALID [2022-02-20 19:48:31,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {14975#true} assume ~id2~0 >= 0; {14975#true} is VALID [2022-02-20 19:48:31,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {14975#true} assume 0 == ~st2~0; {14975#true} is VALID [2022-02-20 19:48:31,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {14975#true} assume ~send2~0 == ~id2~0; {14975#true} is VALID [2022-02-20 19:48:31,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {14975#true} assume 0 == ~mode2~0 % 256; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {14977#(= (+ (* (- 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; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {14977#(= (+ (* (- 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; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {14977#(= (+ (* (- 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; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {14977#(= (+ (* (- 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; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {14977#(= (+ (* (- 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; {14977#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:31,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {14977#(= (+ (* (- 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; {14976#false} is VALID [2022-02-20 19:48:31,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {14976#false} assume !(node2_~m2~0#1 != ~nomsg~0); {14976#false} is VALID [2022-02-20 19:48:31,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {14976#false} ~mode2~0 := 0; {14976#false} is VALID [2022-02-20 19:48:31,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {14976#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; {14976#false} is VALID [2022-02-20 19:48:31,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {14976#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14976#false} is VALID [2022-02-20 19:48:31,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {14976#false} assume !(node3_~m3~0#1 != ~nomsg~0); {14976#false} is VALID [2022-02-20 19:48:31,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {14976#false} ~mode3~0 := 0; {14976#false} is VALID [2022-02-20 19:48:31,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {14976#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; {14976#false} is VALID [2022-02-20 19:48:31,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {14976#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14976#false} is VALID [2022-02-20 19:48:31,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {14976#false} assume !(node4_~m4~0#1 != ~nomsg~0); {14976#false} is VALID [2022-02-20 19:48:31,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {14976#false} ~mode4~0 := 0; {14976#false} is VALID [2022-02-20 19:48:31,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {14976#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; {14976#false} is VALID [2022-02-20 19:48:31,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {14976#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {14976#false} is VALID [2022-02-20 19:48:31,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {14976#false} assume !(node5_~m5~0#1 != ~nomsg~0); {14976#false} is VALID [2022-02-20 19:48:31,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {14976#false} ~mode5~0 := 0; {14976#false} is VALID [2022-02-20 19:48:31,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {14976#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; {14976#false} is VALID [2022-02-20 19:48:31,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {14976#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {14976#false} is VALID [2022-02-20 19:48:31,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {14976#false} assume !(node6_~m6~0#1 != ~nomsg~0); {14976#false} is VALID [2022-02-20 19:48:31,521 INFO L290 TraceCheckUtils]: 70: Hoare triple {14976#false} ~mode6~0 := 0; {14976#false} is VALID [2022-02-20 19:48:31,521 INFO L290 TraceCheckUtils]: 71: Hoare triple {14976#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; {14976#false} is VALID [2022-02-20 19:48:31,521 INFO L290 TraceCheckUtils]: 72: Hoare triple {14976#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {14976#false} is VALID [2022-02-20 19:48:31,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {14976#false} check_#res#1 := check_~tmp~1#1; {14976#false} is VALID [2022-02-20 19:48:31,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {14976#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; {14976#false} is VALID [2022-02-20 19:48:31,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {14976#false} assume 0 == assert_~arg#1 % 256; {14976#false} is VALID [2022-02-20 19:48:31,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {14976#false} assume !false; {14976#false} is VALID [2022-02-20 19:48:31,523 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,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:31,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057341213] [2022-02-20 19:48:31,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057341213] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:31,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:31,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:31,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283758236] [2022-02-20 19:48:31,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:31,524 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,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:31,525 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,574 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,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:31,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:31,575 INFO L87 Difference]: Start difference. First operand 1613 states and 2958 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,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:33,176 INFO L93 Difference]: Finished difference Result 1731 states and 3144 transitions. [2022-02-20 19:48:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:33,176 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,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:33,177 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,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:33,185 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,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:33,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:34,669 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,762 INFO L225 Difference]: With dead ends: 1731 [2022-02-20 19:48:34,762 INFO L226 Difference]: Without dead ends: 1669 [2022-02-20 19:48:34,763 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,764 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,764 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,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2022-02-20 19:48:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2022-02-20 19:48:34,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:34,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.8282282282282283) internal successors, (3044), 1666 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call 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,822 INFO L74 IsIncluded]: Start isIncluded. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.8282282282282283) internal successors, (3044), 1666 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call 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,825 INFO L87 Difference]: Start difference. First operand 1669 states. Second operand has 1667 states, 1665 states have (on average 1.8282282282282283) internal successors, (3044), 1666 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call 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,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:34,906 INFO L93 Difference]: Finished difference Result 1669 states and 3045 transitions. [2022-02-20 19:48:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 3045 transitions. [2022-02-20 19:48:34,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:34,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:34,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 1667 states, 1665 states have (on average 1.8282282282282283) internal successors, (3044), 1666 states have internal predecessors, (3044), 0 states have call successors, (0), 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:34,912 INFO L87 Difference]: Start difference. First operand has 1667 states, 1665 states have (on average 1.8282282282282283) internal successors, (3044), 1666 states have internal predecessors, (3044), 0 states have call successors, (0), 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,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:35,002 INFO L93 Difference]: Finished difference Result 1669 states and 3045 transitions. [2022-02-20 19:48:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 3045 transitions. [2022-02-20 19:48:35,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:35,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:35,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:35,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.8282282282282283) internal successors, (3044), 1666 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call 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,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 3044 transitions. [2022-02-20 19:48:35,098 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 3044 transitions. Word has length 77 [2022-02-20 19:48:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:35,099 INFO L470 AbstractCegarLoop]: Abstraction has 1667 states and 3044 transitions. [2022-02-20 19:48:35,100 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,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 3044 transitions. [2022-02-20 19:48:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:35,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:35,101 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,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:48:35,101 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash 786172563, now seen corresponding path program 1 times [2022-02-20 19:48:35,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:35,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212396942] [2022-02-20 19:48:35,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:35,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {21783#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; {21783#true} is VALID [2022-02-20 19:48:35,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {21783#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; {21783#true} is VALID [2022-02-20 19:48:35,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {21783#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; {21783#true} is VALID [2022-02-20 19:48:35,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {21783#true} assume 0 == ~r1~0 % 256; {21783#true} is VALID [2022-02-20 19:48:35,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {21783#true} assume ~id1~0 >= 0; {21783#true} is VALID [2022-02-20 19:48:35,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {21783#true} assume 0 == ~st1~0; {21783#true} is VALID [2022-02-20 19:48:35,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {21783#true} assume ~send1~0 == ~id1~0; {21783#true} is VALID [2022-02-20 19:48:35,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {21783#true} assume 0 == ~mode1~0 % 256; {21783#true} is VALID [2022-02-20 19:48:35,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {21783#true} assume ~id2~0 >= 0; {21783#true} is VALID [2022-02-20 19:48:35,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {21783#true} assume 0 == ~st2~0; {21783#true} is VALID [2022-02-20 19:48:35,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {21783#true} assume ~send2~0 == ~id2~0; {21783#true} is VALID [2022-02-20 19:48:35,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {21783#true} assume 0 == ~mode2~0 % 256; {21783#true} is VALID [2022-02-20 19:48:35,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {21783#true} assume ~id3~0 >= 0; {21783#true} is VALID [2022-02-20 19:48:35,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {21783#true} assume 0 == ~st3~0; {21783#true} is VALID [2022-02-20 19:48:35,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {21783#true} assume ~send3~0 == ~id3~0; {21783#true} is VALID [2022-02-20 19:48:35,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {21783#true} assume 0 == ~mode3~0 % 256; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {21785#(= (+ (* (- 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; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {21785#(= (+ (* (- 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; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {21785#(= (+ (* (- 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; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {21785#(= (+ (* (- 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; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {21785#(= (+ (* (- 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; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {21785#(= (+ (* (- 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; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {21785#(= (+ (* (- 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; {21785#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:35,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {21785#(= (+ (* (- 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; {21784#false} is VALID [2022-02-20 19:48:35,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {21784#false} assume !(node3_~m3~0#1 != ~nomsg~0); {21784#false} is VALID [2022-02-20 19:48:35,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {21784#false} ~mode3~0 := 0; {21784#false} is VALID [2022-02-20 19:48:35,243 INFO L290 TraceCheckUtils]: 59: Hoare triple {21784#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; {21784#false} is VALID [2022-02-20 19:48:35,244 INFO L290 TraceCheckUtils]: 60: Hoare triple {21784#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21784#false} is VALID [2022-02-20 19:48:35,244 INFO L290 TraceCheckUtils]: 61: Hoare triple {21784#false} assume !(node4_~m4~0#1 != ~nomsg~0); {21784#false} is VALID [2022-02-20 19:48:35,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {21784#false} ~mode4~0 := 0; {21784#false} is VALID [2022-02-20 19:48:35,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {21784#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; {21784#false} is VALID [2022-02-20 19:48:35,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {21784#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21784#false} is VALID [2022-02-20 19:48:35,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {21784#false} assume !(node5_~m5~0#1 != ~nomsg~0); {21784#false} is VALID [2022-02-20 19:48:35,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {21784#false} ~mode5~0 := 0; {21784#false} is VALID [2022-02-20 19:48:35,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {21784#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; {21784#false} is VALID [2022-02-20 19:48:35,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {21784#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {21784#false} is VALID [2022-02-20 19:48:35,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {21784#false} assume !(node6_~m6~0#1 != ~nomsg~0); {21784#false} is VALID [2022-02-20 19:48:35,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {21784#false} ~mode6~0 := 0; {21784#false} is VALID [2022-02-20 19:48:35,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {21784#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; {21784#false} is VALID [2022-02-20 19:48:35,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {21784#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {21784#false} is VALID [2022-02-20 19:48:35,246 INFO L290 TraceCheckUtils]: 73: Hoare triple {21784#false} check_#res#1 := check_~tmp~1#1; {21784#false} is VALID [2022-02-20 19:48:35,246 INFO L290 TraceCheckUtils]: 74: Hoare triple {21784#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; {21784#false} is VALID [2022-02-20 19:48:35,246 INFO L290 TraceCheckUtils]: 75: Hoare triple {21784#false} assume 0 == assert_~arg#1 % 256; {21784#false} is VALID [2022-02-20 19:48:35,246 INFO L290 TraceCheckUtils]: 76: Hoare triple {21784#false} assume !false; {21784#false} is VALID [2022-02-20 19:48:35,246 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,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:35,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212396942] [2022-02-20 19:48:35,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212396942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:35,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:35,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:35,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270089349] [2022-02-20 19:48:35,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:35,248 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,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:35,248 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,302 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,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:35,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:35,304 INFO L87 Difference]: Start difference. First operand 1667 states and 3044 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,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:37,100 INFO L93 Difference]: Finished difference Result 1887 states and 3392 transitions. [2022-02-20 19:48:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:37,101 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,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:37,102 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,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:37,110 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,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:37,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:38,597 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,691 INFO L225 Difference]: With dead ends: 1887 [2022-02-20 19:48:38,691 INFO L226 Difference]: Without dead ends: 1771 [2022-02-20 19:48:38,692 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,693 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,693 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,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-02-20 19:48:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1769. [2022-02-20 19:48:38,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:38,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.8138087153367288) internal successors, (3205), 1768 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call 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,751 INFO L74 IsIncluded]: Start isIncluded. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.8138087153367288) internal successors, (3205), 1768 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call 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,753 INFO L87 Difference]: Start difference. First operand 1771 states. Second operand has 1769 states, 1767 states have (on average 1.8138087153367288) internal successors, (3205), 1768 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call 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,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:38,845 INFO L93 Difference]: Finished difference Result 1771 states and 3206 transitions. [2022-02-20 19:48:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3206 transitions. [2022-02-20 19:48:38,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:38,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:38,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 1769 states, 1767 states have (on average 1.8138087153367288) internal successors, (3205), 1768 states have internal predecessors, (3205), 0 states have call successors, (0), 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:38,852 INFO L87 Difference]: Start difference. First operand has 1769 states, 1767 states have (on average 1.8138087153367288) internal successors, (3205), 1768 states have internal predecessors, (3205), 0 states have call successors, (0), 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:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:38,951 INFO L93 Difference]: Finished difference Result 1771 states and 3206 transitions. [2022-02-20 19:48:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3206 transitions. [2022-02-20 19:48:38,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:38,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:38,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:38,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1767 states have (on average 1.8138087153367288) internal successors, (3205), 1768 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call 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,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 3205 transitions. [2022-02-20 19:48:39,057 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 3205 transitions. Word has length 77 [2022-02-20 19:48:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:39,057 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 3205 transitions. [2022-02-20 19:48:39,057 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,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3205 transitions. [2022-02-20 19:48:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:39,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:39,058 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,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:48:39,059 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:39,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1153858295, now seen corresponding path program 1 times [2022-02-20 19:48:39,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:39,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862796525] [2022-02-20 19:48:39,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:39,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {29098#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; {29098#true} is VALID [2022-02-20 19:48:39,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {29098#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; {29098#true} is VALID [2022-02-20 19:48:39,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {29098#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; {29098#true} is VALID [2022-02-20 19:48:39,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {29098#true} assume 0 == ~r1~0 % 256; {29098#true} is VALID [2022-02-20 19:48:39,109 INFO L290 TraceCheckUtils]: 4: Hoare triple {29098#true} assume ~id1~0 >= 0; {29098#true} is VALID [2022-02-20 19:48:39,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {29098#true} assume 0 == ~st1~0; {29098#true} is VALID [2022-02-20 19:48:39,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {29098#true} assume ~send1~0 == ~id1~0; {29098#true} is VALID [2022-02-20 19:48:39,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {29098#true} assume 0 == ~mode1~0 % 256; {29098#true} is VALID [2022-02-20 19:48:39,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {29098#true} assume ~id2~0 >= 0; {29098#true} is VALID [2022-02-20 19:48:39,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {29098#true} assume 0 == ~st2~0; {29098#true} is VALID [2022-02-20 19:48:39,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {29098#true} assume ~send2~0 == ~id2~0; {29098#true} is VALID [2022-02-20 19:48:39,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {29098#true} assume 0 == ~mode2~0 % 256; {29098#true} is VALID [2022-02-20 19:48:39,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {29098#true} assume ~id3~0 >= 0; {29098#true} is VALID [2022-02-20 19:48:39,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {29098#true} assume 0 == ~st3~0; {29098#true} is VALID [2022-02-20 19:48:39,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {29098#true} assume ~send3~0 == ~id3~0; {29098#true} is VALID [2022-02-20 19:48:39,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {29098#true} assume 0 == ~mode3~0 % 256; {29098#true} is VALID [2022-02-20 19:48:39,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {29098#true} assume ~id4~0 >= 0; {29098#true} is VALID [2022-02-20 19:48:39,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {29098#true} assume 0 == ~st4~0; {29098#true} is VALID [2022-02-20 19:48:39,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {29098#true} assume ~send4~0 == ~id4~0; {29098#true} is VALID [2022-02-20 19:48:39,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {29098#true} assume 0 == ~mode4~0 % 256; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {29100#(= (+ (* (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; {29100#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:39,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {29100#(= (+ (* (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; {29099#false} is VALID [2022-02-20 19:48:39,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {29099#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29099#false} is VALID [2022-02-20 19:48:39,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {29099#false} ~mode4~0 := 0; {29099#false} is VALID [2022-02-20 19:48:39,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {29099#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; {29099#false} is VALID [2022-02-20 19:48:39,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {29099#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29099#false} is VALID [2022-02-20 19:48:39,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {29099#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29099#false} is VALID [2022-02-20 19:48:39,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {29099#false} ~mode5~0 := 0; {29099#false} is VALID [2022-02-20 19:48:39,127 INFO L290 TraceCheckUtils]: 67: Hoare triple {29099#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; {29099#false} is VALID [2022-02-20 19:48:39,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {29099#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {29099#false} is VALID [2022-02-20 19:48:39,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {29099#false} assume !(node6_~m6~0#1 != ~nomsg~0); {29099#false} is VALID [2022-02-20 19:48:39,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {29099#false} ~mode6~0 := 0; {29099#false} is VALID [2022-02-20 19:48:39,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {29099#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; {29099#false} is VALID [2022-02-20 19:48:39,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {29099#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {29099#false} is VALID [2022-02-20 19:48:39,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {29099#false} check_#res#1 := check_~tmp~1#1; {29099#false} is VALID [2022-02-20 19:48:39,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {29099#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; {29099#false} is VALID [2022-02-20 19:48:39,129 INFO L290 TraceCheckUtils]: 75: Hoare triple {29099#false} assume 0 == assert_~arg#1 % 256; {29099#false} is VALID [2022-02-20 19:48:39,129 INFO L290 TraceCheckUtils]: 76: Hoare triple {29099#false} assume !false; {29099#false} is VALID [2022-02-20 19:48:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:48:39,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:39,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862796525] [2022-02-20 19:48:39,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862796525] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:39,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:39,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:39,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951288971] [2022-02-20 19:48:39,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:39,130 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,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:39,131 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,179 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,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:39,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:39,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:39,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:39,180 INFO L87 Difference]: Start difference. First operand 1769 states and 3205 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:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:40,963 INFO L93 Difference]: Finished difference Result 2181 states and 3855 transitions. [2022-02-20 19:48:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:40,963 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:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:40,964 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:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:40,970 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:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:40,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:42,453 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:42,567 INFO L225 Difference]: With dead ends: 2181 [2022-02-20 19:48:42,567 INFO L226 Difference]: Without dead ends: 1963 [2022-02-20 19:48:42,567 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:42,568 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:42,568 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:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-02-20 19:48:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1961. [2022-02-20 19:48:42,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:42,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.7891781521184278) internal successors, (3505), 1960 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call 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:42,632 INFO L74 IsIncluded]: Start isIncluded. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.7891781521184278) internal successors, (3505), 1960 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call 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:42,633 INFO L87 Difference]: Start difference. First operand 1963 states. Second operand has 1961 states, 1959 states have (on average 1.7891781521184278) internal successors, (3505), 1960 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call 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:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:42,744 INFO L93 Difference]: Finished difference Result 1963 states and 3506 transitions. [2022-02-20 19:48:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3506 transitions. [2022-02-20 19:48:42,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:42,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:42,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 1961 states, 1959 states have (on average 1.7891781521184278) internal successors, (3505), 1960 states have internal predecessors, (3505), 0 states have call successors, (0), 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:42,750 INFO L87 Difference]: Start difference. First operand has 1961 states, 1959 states have (on average 1.7891781521184278) internal successors, (3505), 1960 states have internal predecessors, (3505), 0 states have call successors, (0), 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:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:42,863 INFO L93 Difference]: Finished difference Result 1963 states and 3506 transitions. [2022-02-20 19:48:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3506 transitions. [2022-02-20 19:48:42,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:42,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:42,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:42,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1959 states have (on average 1.7891781521184278) internal successors, (3505), 1960 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call 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:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3505 transitions. [2022-02-20 19:48:42,988 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3505 transitions. Word has length 77 [2022-02-20 19:48:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:42,988 INFO L470 AbstractCegarLoop]: Abstraction has 1961 states and 3505 transitions. [2022-02-20 19:48:42,989 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:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3505 transitions. [2022-02-20 19:48:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:42,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:42,989 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:42,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:48:42,990 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:42,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1546824319, now seen corresponding path program 1 times [2022-02-20 19:48:42,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:42,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165520199] [2022-02-20 19:48:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:43,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {37373#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; {37373#true} is VALID [2022-02-20 19:48:43,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {37373#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; {37373#true} is VALID [2022-02-20 19:48:43,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {37373#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; {37373#true} is VALID [2022-02-20 19:48:43,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {37373#true} assume 0 == ~r1~0 % 256; {37373#true} is VALID [2022-02-20 19:48:43,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {37373#true} assume ~id1~0 >= 0; {37373#true} is VALID [2022-02-20 19:48:43,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {37373#true} assume 0 == ~st1~0; {37373#true} is VALID [2022-02-20 19:48:43,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {37373#true} assume ~send1~0 == ~id1~0; {37373#true} is VALID [2022-02-20 19:48:43,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {37373#true} assume 0 == ~mode1~0 % 256; {37373#true} is VALID [2022-02-20 19:48:43,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {37373#true} assume ~id2~0 >= 0; {37373#true} is VALID [2022-02-20 19:48:43,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {37373#true} assume 0 == ~st2~0; {37373#true} is VALID [2022-02-20 19:48:43,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {37373#true} assume ~send2~0 == ~id2~0; {37373#true} is VALID [2022-02-20 19:48:43,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {37373#true} assume 0 == ~mode2~0 % 256; {37373#true} is VALID [2022-02-20 19:48:43,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {37373#true} assume ~id3~0 >= 0; {37373#true} is VALID [2022-02-20 19:48:43,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {37373#true} assume 0 == ~st3~0; {37373#true} is VALID [2022-02-20 19:48:43,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {37373#true} assume ~send3~0 == ~id3~0; {37373#true} is VALID [2022-02-20 19:48:43,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {37373#true} assume 0 == ~mode3~0 % 256; {37373#true} is VALID [2022-02-20 19:48:43,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {37373#true} assume ~id4~0 >= 0; {37373#true} is VALID [2022-02-20 19:48:43,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {37373#true} assume 0 == ~st4~0; {37373#true} is VALID [2022-02-20 19:48:43,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {37373#true} assume ~send4~0 == ~id4~0; {37373#true} is VALID [2022-02-20 19:48:43,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {37373#true} assume 0 == ~mode4~0 % 256; {37373#true} is VALID [2022-02-20 19:48:43,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {37373#true} assume ~id5~0 >= 0; {37373#true} is VALID [2022-02-20 19:48:43,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {37373#true} assume 0 == ~st5~0; {37373#true} is VALID [2022-02-20 19:48:43,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {37373#true} assume ~send5~0 == ~id5~0; {37373#true} is VALID [2022-02-20 19:48:43,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {37373#true} assume 0 == ~mode5~0 % 256; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,060 INFO L290 TraceCheckUtils]: 59: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {37375#(= (+ (* (- 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; {37375#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:43,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {37375#(= (+ (* (- 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; {37374#false} is VALID [2022-02-20 19:48:43,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {37374#false} assume !(node5_~m5~0#1 != ~nomsg~0); {37374#false} is VALID [2022-02-20 19:48:43,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {37374#false} ~mode5~0 := 0; {37374#false} is VALID [2022-02-20 19:48:43,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {37374#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; {37374#false} is VALID [2022-02-20 19:48:43,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {37374#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {37374#false} is VALID [2022-02-20 19:48:43,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {37374#false} assume !(node6_~m6~0#1 != ~nomsg~0); {37374#false} is VALID [2022-02-20 19:48:43,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {37374#false} ~mode6~0 := 0; {37374#false} is VALID [2022-02-20 19:48:43,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {37374#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; {37374#false} is VALID [2022-02-20 19:48:43,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {37374#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {37374#false} is VALID [2022-02-20 19:48:43,065 INFO L290 TraceCheckUtils]: 73: Hoare triple {37374#false} check_#res#1 := check_~tmp~1#1; {37374#false} is VALID [2022-02-20 19:48:43,065 INFO L290 TraceCheckUtils]: 74: Hoare triple {37374#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; {37374#false} is VALID [2022-02-20 19:48:43,065 INFO L290 TraceCheckUtils]: 75: Hoare triple {37374#false} assume 0 == assert_~arg#1 % 256; {37374#false} is VALID [2022-02-20 19:48:43,065 INFO L290 TraceCheckUtils]: 76: Hoare triple {37374#false} assume !false; {37374#false} is VALID [2022-02-20 19:48:43,066 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,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:43,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165520199] [2022-02-20 19:48:43,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165520199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:43,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:43,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:43,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147186139] [2022-02-20 19:48:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:43,068 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,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:43,069 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,109 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,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:43,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:43,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:43,111 INFO L87 Difference]: Start difference. First operand 1961 states and 3505 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,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:45,030 INFO L93 Difference]: Finished difference Result 2733 states and 4715 transitions. [2022-02-20 19:48:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:45,030 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,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:45,031 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,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:45,037 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,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:45,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:46,522 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:46,709 INFO L225 Difference]: With dead ends: 2733 [2022-02-20 19:48:46,710 INFO L226 Difference]: Without dead ends: 2323 [2022-02-20 19:48:46,711 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:46,712 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:46,712 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:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2022-02-20 19:48:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2321. [2022-02-20 19:48:46,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:46,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.7511858559724018) internal successors, (4061), 2320 states have internal predecessors, (4061), 0 states have call successors, (0), 0 states have call 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:46,903 INFO L74 IsIncluded]: Start isIncluded. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.7511858559724018) internal successors, (4061), 2320 states have internal predecessors, (4061), 0 states have call successors, (0), 0 states have call 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:46,905 INFO L87 Difference]: Start difference. First operand 2323 states. Second operand has 2321 states, 2319 states have (on average 1.7511858559724018) internal successors, (4061), 2320 states have internal predecessors, (4061), 0 states have call successors, (0), 0 states have call 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,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:47,058 INFO L93 Difference]: Finished difference Result 2323 states and 4062 transitions. [2022-02-20 19:48:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 4062 transitions. [2022-02-20 19:48:47,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:47,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:47,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 2321 states, 2319 states have (on average 1.7511858559724018) internal successors, (4061), 2320 states have internal predecessors, (4061), 0 states have call successors, (0), 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,065 INFO L87 Difference]: Start difference. First operand has 2321 states, 2319 states have (on average 1.7511858559724018) internal successors, (4061), 2320 states have internal predecessors, (4061), 0 states have call successors, (0), 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,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:47,221 INFO L93 Difference]: Finished difference Result 2323 states and 4062 transitions. [2022-02-20 19:48:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 4062 transitions. [2022-02-20 19:48:47,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:47,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:47,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:47,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2319 states have (on average 1.7511858559724018) internal successors, (4061), 2320 states have internal predecessors, (4061), 0 states have call successors, (0), 0 states have call 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,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4061 transitions. [2022-02-20 19:48:47,401 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4061 transitions. Word has length 77 [2022-02-20 19:48:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:47,401 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 4061 transitions. [2022-02-20 19:48:47,401 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:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4061 transitions. [2022-02-20 19:48:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:47,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:47,403 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:47,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:48:47,403 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1884617461, now seen corresponding path program 1 times [2022-02-20 19:48:47,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:47,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919769878] [2022-02-20 19:48:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:47,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {47460#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; {47460#true} is VALID [2022-02-20 19:48:47,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {47460#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; {47460#true} is VALID [2022-02-20 19:48:47,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {47460#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; {47460#true} is VALID [2022-02-20 19:48:47,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {47460#true} assume 0 == ~r1~0 % 256; {47460#true} is VALID [2022-02-20 19:48:47,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {47460#true} assume ~id1~0 >= 0; {47460#true} is VALID [2022-02-20 19:48:47,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {47460#true} assume 0 == ~st1~0; {47460#true} is VALID [2022-02-20 19:48:47,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {47460#true} assume ~send1~0 == ~id1~0; {47460#true} is VALID [2022-02-20 19:48:47,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {47460#true} assume 0 == ~mode1~0 % 256; {47460#true} is VALID [2022-02-20 19:48:47,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {47460#true} assume ~id2~0 >= 0; {47460#true} is VALID [2022-02-20 19:48:47,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {47460#true} assume 0 == ~st2~0; {47460#true} is VALID [2022-02-20 19:48:47,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {47460#true} assume ~send2~0 == ~id2~0; {47460#true} is VALID [2022-02-20 19:48:47,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {47460#true} assume 0 == ~mode2~0 % 256; {47460#true} is VALID [2022-02-20 19:48:47,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {47460#true} assume ~id3~0 >= 0; {47460#true} is VALID [2022-02-20 19:48:47,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {47460#true} assume 0 == ~st3~0; {47460#true} is VALID [2022-02-20 19:48:47,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {47460#true} assume ~send3~0 == ~id3~0; {47460#true} is VALID [2022-02-20 19:48:47,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {47460#true} assume 0 == ~mode3~0 % 256; {47460#true} is VALID [2022-02-20 19:48:47,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {47460#true} assume ~id4~0 >= 0; {47460#true} is VALID [2022-02-20 19:48:47,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {47460#true} assume 0 == ~st4~0; {47460#true} is VALID [2022-02-20 19:48:47,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {47460#true} assume ~send4~0 == ~id4~0; {47460#true} is VALID [2022-02-20 19:48:47,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {47460#true} assume 0 == ~mode4~0 % 256; {47460#true} is VALID [2022-02-20 19:48:47,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {47460#true} assume ~id5~0 >= 0; {47460#true} is VALID [2022-02-20 19:48:47,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {47460#true} assume 0 == ~st5~0; {47460#true} is VALID [2022-02-20 19:48:47,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {47460#true} assume ~send5~0 == ~id5~0; {47460#true} is VALID [2022-02-20 19:48:47,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {47460#true} assume 0 == ~mode5~0 % 256; {47460#true} is VALID [2022-02-20 19:48:47,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {47460#true} assume ~id6~0 >= 0; {47460#true} is VALID [2022-02-20 19:48:47,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {47460#true} assume 0 == ~st6~0; {47460#true} is VALID [2022-02-20 19:48:47,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {47460#true} assume ~send6~0 == ~id6~0; {47460#true} is VALID [2022-02-20 19:48:47,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {47460#true} assume 0 == ~mode6~0 % 256; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,500 INFO L290 TraceCheckUtils]: 66: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,501 INFO L290 TraceCheckUtils]: 67: Hoare triple {47462#(= (+ (* (- 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; {47462#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:48:47,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {47462#(= (+ (* (- 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; {47461#false} is VALID [2022-02-20 19:48:47,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {47461#false} assume !(node6_~m6~0#1 != ~nomsg~0); {47461#false} is VALID [2022-02-20 19:48:47,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {47461#false} ~mode6~0 := 0; {47461#false} is VALID [2022-02-20 19:48:47,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {47461#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; {47461#false} is VALID [2022-02-20 19:48:47,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {47461#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {47461#false} is VALID [2022-02-20 19:48:47,502 INFO L290 TraceCheckUtils]: 73: Hoare triple {47461#false} check_#res#1 := check_~tmp~1#1; {47461#false} is VALID [2022-02-20 19:48:47,502 INFO L290 TraceCheckUtils]: 74: Hoare triple {47461#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; {47461#false} is VALID [2022-02-20 19:48:47,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {47461#false} assume 0 == assert_~arg#1 % 256; {47461#false} is VALID [2022-02-20 19:48:47,503 INFO L290 TraceCheckUtils]: 76: Hoare triple {47461#false} assume !false; {47461#false} is VALID [2022-02-20 19:48:47,503 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:47,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:47,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919769878] [2022-02-20 19:48:47,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919769878] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:47,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:47,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:47,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053980937] [2022-02-20 19:48:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:47,505 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:47,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:47,505 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:47,566 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:47,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:47,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:47,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:47,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:47,567 INFO L87 Difference]: Start difference. First operand 2321 states and 4061 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:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:49,994 INFO L93 Difference]: Finished difference Result 3765 states and 6303 transitions. [2022-02-20 19:48:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:49,995 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:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:49,995 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,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:50,001 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,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:50,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:51,520 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:51,814 INFO L225 Difference]: With dead ends: 3765 [2022-02-20 19:48:51,814 INFO L226 Difference]: Without dead ends: 2995 [2022-02-20 19:48:51,830 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:51,844 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:51,844 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:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2022-02-20 19:48:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2993. [2022-02-20 19:48:52,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:52,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.700100300902708) internal successors, (5085), 2992 states have internal predecessors, (5085), 0 states have call successors, (0), 0 states have call 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,055 INFO L74 IsIncluded]: Start isIncluded. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.700100300902708) internal successors, (5085), 2992 states have internal predecessors, (5085), 0 states have call successors, (0), 0 states have call 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,057 INFO L87 Difference]: Start difference. First operand 2995 states. Second operand has 2993 states, 2991 states have (on average 1.700100300902708) internal successors, (5085), 2992 states have internal predecessors, (5085), 0 states have call successors, (0), 0 states have call 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,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:52,310 INFO L93 Difference]: Finished difference Result 2995 states and 5086 transitions. [2022-02-20 19:48:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 5086 transitions. [2022-02-20 19:48:52,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:52,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:52,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 2993 states, 2991 states have (on average 1.700100300902708) internal successors, (5085), 2992 states have internal predecessors, (5085), 0 states have call successors, (0), 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:52,319 INFO L87 Difference]: Start difference. First operand has 2993 states, 2991 states have (on average 1.700100300902708) internal successors, (5085), 2992 states have internal predecessors, (5085), 0 states have call successors, (0), 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:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:52,564 INFO L93 Difference]: Finished difference Result 2995 states and 5086 transitions. [2022-02-20 19:48:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 5086 transitions. [2022-02-20 19:48:52,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:52,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:52,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:52,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2991 states have (on average 1.700100300902708) internal successors, (5085), 2992 states have internal predecessors, (5085), 0 states have call successors, (0), 0 states have call 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,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 5085 transitions. [2022-02-20 19:48:52,894 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 5085 transitions. Word has length 77 [2022-02-20 19:48:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:52,894 INFO L470 AbstractCegarLoop]: Abstraction has 2993 states and 5085 transitions. [2022-02-20 19:48:52,894 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:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 5085 transitions. [2022-02-20 19:48:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:52,895 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:52,895 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:52,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:48:52,896 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:52,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2001711063, now seen corresponding path program 1 times [2022-02-20 19:48:52,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:52,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280535307] [2022-02-20 19:48:52,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:52,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:52,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {60955#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; {60955#true} is VALID [2022-02-20 19:48:52,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {60955#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; {60955#true} is VALID [2022-02-20 19:48:52,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {60955#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; {60955#true} is VALID [2022-02-20 19:48:52,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {60955#true} assume 0 == ~r1~0 % 256; {60955#true} is VALID [2022-02-20 19:48:52,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {60955#true} assume ~id1~0 >= 0; {60955#true} is VALID [2022-02-20 19:48:52,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {60955#true} assume 0 == ~st1~0; {60957#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:52,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {60957#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {60957#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:52,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {60957#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {60957#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:52,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {60957#(<= ~st1~0 0)} assume ~id2~0 >= 0; {60957#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:52,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {60957#(<= ~st1~0 0)} assume 0 == ~st2~0; {60958#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {60958#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {60958#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {60958#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {60958#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {60958#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {60958#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {60958#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {60959#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {60959#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {60959#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {60959#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {60959#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {60959#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {60959#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {60959#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {60960#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {60960#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {60960#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {60960#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {60960#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {60960#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {60960#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {60960#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {60961#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {60961#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {60961#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {60961#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {60961#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {60961#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {60961#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:52,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {60961#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,998 INFO L290 TraceCheckUtils]: 50: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,998 INFO L290 TraceCheckUtils]: 52: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:52,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,000 INFO L290 TraceCheckUtils]: 56: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,000 INFO L290 TraceCheckUtils]: 57: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,001 INFO L290 TraceCheckUtils]: 58: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,001 INFO L290 TraceCheckUtils]: 59: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,001 INFO L290 TraceCheckUtils]: 60: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,002 INFO L290 TraceCheckUtils]: 61: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,002 INFO L290 TraceCheckUtils]: 62: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,002 INFO L290 TraceCheckUtils]: 63: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,003 INFO L290 TraceCheckUtils]: 64: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,003 INFO L290 TraceCheckUtils]: 66: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,004 INFO L290 TraceCheckUtils]: 67: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,005 INFO L290 TraceCheckUtils]: 69: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,005 INFO L290 TraceCheckUtils]: 70: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {60962#(<= (+ ~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; {60962#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:53,006 INFO L290 TraceCheckUtils]: 72: Hoare triple {60962#(<= (+ ~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; {60956#false} is VALID [2022-02-20 19:48:53,006 INFO L290 TraceCheckUtils]: 73: Hoare triple {60956#false} check_#res#1 := check_~tmp~1#1; {60956#false} is VALID [2022-02-20 19:48:53,006 INFO L290 TraceCheckUtils]: 74: Hoare triple {60956#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; {60956#false} is VALID [2022-02-20 19:48:53,006 INFO L290 TraceCheckUtils]: 75: Hoare triple {60956#false} assume 0 == assert_~arg#1 % 256; {60956#false} is VALID [2022-02-20 19:48:53,006 INFO L290 TraceCheckUtils]: 76: Hoare triple {60956#false} assume !false; {60956#false} is VALID [2022-02-20 19:48:53,007 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,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:53,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280535307] [2022-02-20 19:48:53,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280535307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:53,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:53,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:48:53,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865682051] [2022-02-20 19:48:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:53,008 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,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:53,008 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,059 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,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:48:53,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:53,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:48:53,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:48:53,060 INFO L87 Difference]: Start difference. First operand 2993 states and 5085 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)