./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.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 ea57353cc426bb7be013ba8e868acb1e36cb4a21de21bdceb8574c529d37e477 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:43:13,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:43:13,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:43:13,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:43:13,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:43:13,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:43:13,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:43:13,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:43:13,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:43:13,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:43:13,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:43:13,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:43:13,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:43:13,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:43:13,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:43:13,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:43:13,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:43:13,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:43:13,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:43:13,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:43:13,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:43:13,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:43:13,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:43:13,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:43:13,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:43:13,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:43:13,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:43:13,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:43:13,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:43:13,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:43:13,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:43:13,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:43:13,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:43:13,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:43:13,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:43:13,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:43:13,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:43:13,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:43:13,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:43:13,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:43:13,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:43:13,205 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:43:13,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:43:13,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:43:13,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:43:13,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:43:13,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:43:13,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:43:13,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:43:13,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:43:13,235 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:43:13,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:43:13,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:43:13,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:43:13,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:43:13,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:43:13,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:43:13,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:43:13,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:43:13,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:43:13,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:43:13,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:43:13,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:43:13,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:43:13,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:43:13,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:43:13,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:43:13,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:43:13,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:43:13,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:43:13,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:43:13,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:43:13,239 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:43:13,239 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:43:13,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:43:13,239 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 -> ea57353cc426bb7be013ba8e868acb1e36cb4a21de21bdceb8574c529d37e477 [2022-02-20 19:43:13,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:43:13,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:43:13,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:43:13,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:43:13,500 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:43:13,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:43:13,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d26177e/1f6d2c65e8714affa00a4566a4878938/FLAG25d5cbd92 [2022-02-20 19:43:14,162 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:43:14,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:43:14,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d26177e/1f6d2c65e8714affa00a4566a4878938/FLAG25d5cbd92 [2022-02-20 19:43:14,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d26177e/1f6d2c65e8714affa00a4566a4878938 [2022-02-20 19:43:14,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:43:14,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:43:14,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:43:14,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:43:14,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:43:14,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:43:14" (1/1) ... [2022-02-20 19:43:14,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c84634f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:14, skipping insertion in model container [2022-02-20 19:43:14,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:43:14" (1/1) ... [2022-02-20 19:43:14,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:43:14,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:43:14,718 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[8786,8799] [2022-02-20 19:43:14,764 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[16534,16547] [2022-02-20 19:43:15,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:43:15,311 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:43:15,344 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[8786,8799] [2022-02-20 19:43:15,354 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[16534,16547] [2022-02-20 19:43:15,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:43:15,763 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:43:15,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15 WrapperNode [2022-02-20 19:43:15,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:43:15,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:43:15,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:43:15,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:43:15,771 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:43:15" (1/1) ... [2022-02-20 19:43:15,823 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:43:15" (1/1) ... [2022-02-20 19:43:16,130 INFO L137 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5029 [2022-02-20 19:43:16,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:43:16,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:43:16,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:43:16,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:43:16,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (1/1) ... [2022-02-20 19:43:16,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (1/1) ... [2022-02-20 19:43:16,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (1/1) ... [2022-02-20 19:43:16,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (1/1) ... [2022-02-20 19:43:16,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (1/1) ... [2022-02-20 19:43:16,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (1/1) ... [2022-02-20 19:43:16,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (1/1) ... [2022-02-20 19:43:16,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:43:16,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:43:16,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:43:16,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:43:16,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (1/1) ... [2022-02-20 19:43:16,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:43:16,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:43:16,546 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:43:16,595 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:43:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:43:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:43:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:43:16,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:43:16,727 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:43:16,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:43:23,550 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:43:23,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:43:23,569 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:43:23,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:43:23 BoogieIcfgContainer [2022-02-20 19:43:23,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:43:23,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:43:23,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:43:23,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:43:23,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:43:14" (1/3) ... [2022-02-20 19:43:23,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce834b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:43:23, skipping insertion in model container [2022-02-20 19:43:23,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:43:15" (2/3) ... [2022-02-20 19:43:23,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce834b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:43:23, skipping insertion in model container [2022-02-20 19:43:23,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:43:23" (3/3) ... [2022-02-20 19:43:23,579 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:43:23,584 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:43:23,584 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:43:23,637 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:43:23,642 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:43:23,643 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:43:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:43:23,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:23,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:23,686 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1675876582, now seen corresponding path program 1 times [2022-02-20 19:43:23,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:23,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489511523] [2022-02-20 19:43:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:23,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {896#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(41, 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;~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; {896#true} is VALID [2022-02-20 19:43:23,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {896#true} is VALID [2022-02-20 19:43:23,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {896#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {896#true} is VALID [2022-02-20 19:43:23,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {896#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {896#true} is VALID [2022-02-20 19:43:23,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {896#true} init_#res#1 := init_~tmp~0#1; {896#true} is VALID [2022-02-20 19:43:23,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {896#true} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {896#true} is VALID [2022-02-20 19:43:23,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {896#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {897#false} is VALID [2022-02-20 19:43:23,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {897#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;main1_~i2~0#1 := 0; {897#false} is VALID [2022-02-20 19:43:23,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {897#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; {897#false} is VALID [2022-02-20 19:43:23,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {897#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:43:23,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {897#false} assume !(node1_~m1~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:43:23,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#false} ~mode1~0 := 0; {897#false} is VALID [2022-02-20 19:43:23,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#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; {897#false} is VALID [2022-02-20 19:43:23,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:43:23,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {897#false} assume !(node2_~m2~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:43:23,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {897#false} ~mode2~0 := 0; {897#false} is VALID [2022-02-20 19:43:23,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {897#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; {897#false} is VALID [2022-02-20 19:43:23,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {897#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:43:23,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {897#false} assume !(node3_~m3~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:43:23,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {897#false} ~mode3~0 := 0; {897#false} is VALID [2022-02-20 19:43:23,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {897#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; {897#false} is VALID [2022-02-20 19:43:23,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {897#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:43:23,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {897#false} assume !(node4_~m4~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:43:23,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {897#false} ~mode4~0 := 0; {897#false} is VALID [2022-02-20 19:43:23,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {897#false} is VALID [2022-02-20 19:43:23,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {897#false} is VALID [2022-02-20 19:43:23,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {897#false} check_#res#1 := check_~tmp~1#1; {897#false} is VALID [2022-02-20 19:43:23,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {897#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {897#false} is VALID [2022-02-20 19:43:23,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {897#false} assume 0 == assert_~arg#1 % 256; {897#false} is VALID [2022-02-20 19:43:23,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {897#false} assume !false; {897#false} is VALID [2022-02-20 19:43:23,948 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:43:23,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:23,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489511523] [2022-02-20 19:43:23,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489511523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:23,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:23,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:43:23,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183970892] [2022-02-20 19:43:23,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:23,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:43:23,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:23,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:23,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:23,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:43:23,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:24,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:43:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:43:24,017 INFO L87 Difference]: Start difference. First operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 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 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:25,335 INFO L93 Difference]: Finished difference Result 1755 states and 3330 transitions. [2022-02-20 19:43:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:43:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:43:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3330 transitions. [2022-02-20 19:43:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3330 transitions. [2022-02-20 19:43:25,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3330 transitions. [2022-02-20 19:43:27,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3330 edges. 3330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:28,044 INFO L225 Difference]: With dead ends: 1755 [2022-02-20 19:43:28,044 INFO L226 Difference]: Without dead ends: 827 [2022-02-20 19:43:28,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:43:28,056 INFO L933 BasicCegarLoop]: 1624 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:28,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-02-20 19:43:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-02-20 19:43:28,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:28,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,135 INFO L74 IsIncluded]: Start isIncluded. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,137 INFO L87 Difference]: Start difference. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:28,167 INFO L93 Difference]: Finished difference Result 827 states and 1560 transitions. [2022-02-20 19:43:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:43:28,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:28,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:28,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:43:28,178 INFO L87 Difference]: Start difference. First operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:43:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:28,209 INFO L93 Difference]: Finished difference Result 827 states and 1560 transitions. [2022-02-20 19:43:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:43:28,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:28,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:28,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:28,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1560 transitions. [2022-02-20 19:43:28,249 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1560 transitions. Word has length 30 [2022-02-20 19:43:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:28,252 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1560 transitions. [2022-02-20 19:43:28,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:43:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:43:28,253 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:28,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:28,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:43:28,254 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:28,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:28,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1541863076, now seen corresponding path program 1 times [2022-02-20 19:43:28,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:28,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261195206] [2022-02-20 19:43:28,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:28,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:28,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {5177#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(41, 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;~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; {5177#true} is VALID [2022-02-20 19:43:28,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {5177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {5177#true} is VALID [2022-02-20 19:43:28,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {5177#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5177#true} is VALID [2022-02-20 19:43:28,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {5177#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5179#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:43:28,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {5179#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5180#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:43:28,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {5180#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {5181#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:43:28,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {5181#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5178#false} is VALID [2022-02-20 19:43:28,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {5178#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;main1_~i2~0#1 := 0; {5178#false} is VALID [2022-02-20 19:43:28,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {5178#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; {5178#false} is VALID [2022-02-20 19:43:28,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {5178#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:28,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {5178#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5178#false} is VALID [2022-02-20 19:43:28,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {5178#false} ~mode1~0 := 0; {5178#false} is VALID [2022-02-20 19:43:28,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {5178#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; {5178#false} is VALID [2022-02-20 19:43:28,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {5178#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:28,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {5178#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5178#false} is VALID [2022-02-20 19:43:28,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {5178#false} ~mode2~0 := 0; {5178#false} is VALID [2022-02-20 19:43:28,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {5178#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; {5178#false} is VALID [2022-02-20 19:43:28,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {5178#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:28,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {5178#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5178#false} is VALID [2022-02-20 19:43:28,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {5178#false} ~mode3~0 := 0; {5178#false} is VALID [2022-02-20 19:43:28,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {5178#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; {5178#false} is VALID [2022-02-20 19:43:28,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {5178#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5178#false} is VALID [2022-02-20 19:43:28,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {5178#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5178#false} is VALID [2022-02-20 19:43:28,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {5178#false} ~mode4~0 := 0; {5178#false} is VALID [2022-02-20 19:43:28,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {5178#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5178#false} is VALID [2022-02-20 19:43:28,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {5178#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {5178#false} is VALID [2022-02-20 19:43:28,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {5178#false} check_#res#1 := check_~tmp~1#1; {5178#false} is VALID [2022-02-20 19:43:28,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {5178#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {5178#false} is VALID [2022-02-20 19:43:28,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {5178#false} assume 0 == assert_~arg#1 % 256; {5178#false} is VALID [2022-02-20 19:43:28,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {5178#false} assume !false; {5178#false} is VALID [2022-02-20 19:43:28,357 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:43:28,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:28,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261195206] [2022-02-20 19:43:28,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261195206] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:28,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:28,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:43:28,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348739667] [2022-02-20 19:43:28,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:28,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:43:28,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:28,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:28,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:28,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:43:28,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:28,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:43:28,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:43:28,378 INFO L87 Difference]: Start difference. First operand 827 states and 1560 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:32,389 INFO L93 Difference]: Finished difference Result 875 states and 1633 transitions. [2022-02-20 19:43:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:43:32,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:43:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1633 transitions. [2022-02-20 19:43:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1633 transitions. [2022-02-20 19:43:32,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1633 transitions. [2022-02-20 19:43:33,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1633 edges. 1633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:33,631 INFO L225 Difference]: With dead ends: 875 [2022-02-20 19:43:33,631 INFO L226 Difference]: Without dead ends: 827 [2022-02-20 19:43:33,635 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:43:33,637 INFO L933 BasicCegarLoop]: 1558 mSDtfsCounter, 3 mSDsluCounter, 4648 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6206 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:33,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6206 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-02-20 19:43:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-02-20 19:43:33,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:33,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,657 INFO L74 IsIncluded]: Start isIncluded. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,658 INFO L87 Difference]: Start difference. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:33,683 INFO L93 Difference]: Finished difference Result 827 states and 1537 transitions. [2022-02-20 19:43:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1537 transitions. [2022-02-20 19:43:33,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:33,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:33,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:43:33,689 INFO L87 Difference]: Start difference. First operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:43:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:33,721 INFO L93 Difference]: Finished difference Result 827 states and 1537 transitions. [2022-02-20 19:43:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1537 transitions. [2022-02-20 19:43:33,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:33,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:33,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:33,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1537 transitions. [2022-02-20 19:43:33,750 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1537 transitions. Word has length 30 [2022-02-20 19:43:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:33,750 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1537 transitions. [2022-02-20 19:43:33,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1537 transitions. [2022-02-20 19:43:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:33,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:33,754 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] [2022-02-20 19:43:33,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:43:33,755 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 159296799, now seen corresponding path program 1 times [2022-02-20 19:43:33,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:33,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887841577] [2022-02-20 19:43:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:33,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {8578#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(41, 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;~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; {8578#true} is VALID [2022-02-20 19:43:33,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {8578#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {8578#true} is VALID [2022-02-20 19:43:33,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {8578#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8578#true} is VALID [2022-02-20 19:43:33,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {8578#true} assume 0 == ~r1~0 % 256; {8578#true} is VALID [2022-02-20 19:43:33,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {8578#true} assume ~id1~0 >= 0; {8578#true} is VALID [2022-02-20 19:43:33,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {8578#true} assume 0 == ~st1~0; {8578#true} is VALID [2022-02-20 19:43:33,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {8578#true} assume ~send1~0 == ~id1~0; {8578#true} is VALID [2022-02-20 19:43:33,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {8578#true} assume 0 == ~mode1~0 % 256; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:43:33,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {8580#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8579#false} is VALID [2022-02-20 19:43:33,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {8579#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8579#false} is VALID [2022-02-20 19:43:33,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {8579#false} ~mode1~0 := 0; {8579#false} is VALID [2022-02-20 19:43:33,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {8579#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; {8579#false} is VALID [2022-02-20 19:43:33,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {8579#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8579#false} is VALID [2022-02-20 19:43:33,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {8579#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8579#false} is VALID [2022-02-20 19:43:33,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {8579#false} ~mode2~0 := 0; {8579#false} is VALID [2022-02-20 19:43:33,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {8579#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; {8579#false} is VALID [2022-02-20 19:43:33,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {8579#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8579#false} is VALID [2022-02-20 19:43:33,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {8579#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8579#false} is VALID [2022-02-20 19:43:33,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {8579#false} ~mode3~0 := 0; {8579#false} is VALID [2022-02-20 19:43:33,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {8579#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; {8579#false} is VALID [2022-02-20 19:43:33,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {8579#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8579#false} is VALID [2022-02-20 19:43:33,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {8579#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8579#false} is VALID [2022-02-20 19:43:33,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {8579#false} ~mode4~0 := 0; {8579#false} is VALID [2022-02-20 19:43:33,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {8579#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8579#false} is VALID [2022-02-20 19:43:33,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {8579#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {8579#false} is VALID [2022-02-20 19:43:33,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {8579#false} check_#res#1 := check_~tmp~1#1; {8579#false} is VALID [2022-02-20 19:43:33,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {8579#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {8579#false} is VALID [2022-02-20 19:43:33,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {8579#false} assume 0 == assert_~arg#1 % 256; {8579#false} is VALID [2022-02-20 19:43:33,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {8579#false} assume !false; {8579#false} is VALID [2022-02-20 19:43:33,893 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:43:33,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:33,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887841577] [2022-02-20 19:43:33,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887841577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:33,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:33,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:33,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425530695] [2022-02-20 19:43:33,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:33,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:33,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:33,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:33,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:33,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:33,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:33,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:33,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:33,926 INFO L87 Difference]: Start difference. First operand 827 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:35,669 INFO L93 Difference]: Finished difference Result 909 states and 1665 transitions. [2022-02-20 19:43:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:35,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:43:37,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:37,190 INFO L225 Difference]: With dead ends: 909 [2022-02-20 19:43:37,191 INFO L226 Difference]: Without dead ends: 865 [2022-02-20 19:43:37,191 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:43:37,192 INFO L933 BasicCegarLoop]: 1592 mSDtfsCounter, 1498 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1659 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:43:37,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1659 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2022-02-20 19:43:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 863. [2022-02-20 19:43:37,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:37,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 865 states. Second operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,205 INFO L74 IsIncluded]: Start isIncluded. First operand 865 states. Second operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,207 INFO L87 Difference]: Start difference. First operand 865 states. Second operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:37,234 INFO L93 Difference]: Finished difference Result 865 states and 1595 transitions. [2022-02-20 19:43:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1595 transitions. [2022-02-20 19:43:37,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:37,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:37,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 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 865 states. [2022-02-20 19:43:37,238 INFO L87 Difference]: Start difference. First operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 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 865 states. [2022-02-20 19:43:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:37,266 INFO L93 Difference]: Finished difference Result 865 states and 1595 transitions. [2022-02-20 19:43:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1595 transitions. [2022-02-20 19:43:37,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:37,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:37,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:37,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.8513356562137049) internal successors, (1594), 862 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1594 transitions. [2022-02-20 19:43:37,296 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1594 transitions. Word has length 52 [2022-02-20 19:43:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:37,298 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1594 transitions. [2022-02-20 19:43:37,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1594 transitions. [2022-02-20 19:43:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:37,299 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:37,299 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] [2022-02-20 19:43:37,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:43:37,299 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1780734059, now seen corresponding path program 1 times [2022-02-20 19:43:37,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:37,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11478635] [2022-02-20 19:43:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:37,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {12132#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(41, 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;~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; {12132#true} is VALID [2022-02-20 19:43:37,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {12132#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {12132#true} is VALID [2022-02-20 19:43:37,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {12132#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12132#true} is VALID [2022-02-20 19:43:37,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {12132#true} assume 0 == ~r1~0 % 256; {12132#true} is VALID [2022-02-20 19:43:37,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {12132#true} assume ~id1~0 >= 0; {12132#true} is VALID [2022-02-20 19:43:37,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {12132#true} assume 0 == ~st1~0; {12132#true} is VALID [2022-02-20 19:43:37,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {12132#true} assume ~send1~0 == ~id1~0; {12132#true} is VALID [2022-02-20 19:43:37,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {12132#true} assume 0 == ~mode1~0 % 256; {12132#true} is VALID [2022-02-20 19:43:37,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {12132#true} assume ~id2~0 >= 0; {12132#true} is VALID [2022-02-20 19:43:37,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {12132#true} assume 0 == ~st2~0; {12132#true} is VALID [2022-02-20 19:43:37,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {12132#true} assume ~send2~0 == ~id2~0; {12132#true} is VALID [2022-02-20 19:43:37,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {12132#true} assume 0 == ~mode2~0 % 256; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {12134#(= (+ (* (- 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;main1_~i2~0#1 := 0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {12134#(= (+ (* (- 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; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {12134#(= (+ (* (- 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; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {12134#(= (+ (* (- 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; {12134#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:37,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {12134#(= (+ (* (- 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; {12133#false} is VALID [2022-02-20 19:43:37,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {12133#false} assume !(node2_~m2~0#1 != ~nomsg~0); {12133#false} is VALID [2022-02-20 19:43:37,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {12133#false} ~mode2~0 := 0; {12133#false} is VALID [2022-02-20 19:43:37,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {12133#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; {12133#false} is VALID [2022-02-20 19:43:37,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {12133#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12133#false} is VALID [2022-02-20 19:43:37,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {12133#false} assume !(node3_~m3~0#1 != ~nomsg~0); {12133#false} is VALID [2022-02-20 19:43:37,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {12133#false} ~mode3~0 := 0; {12133#false} is VALID [2022-02-20 19:43:37,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {12133#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; {12133#false} is VALID [2022-02-20 19:43:37,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {12133#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12133#false} is VALID [2022-02-20 19:43:37,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {12133#false} assume !(node4_~m4~0#1 != ~nomsg~0); {12133#false} is VALID [2022-02-20 19:43:37,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {12133#false} ~mode4~0 := 0; {12133#false} is VALID [2022-02-20 19:43:37,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {12133#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12133#false} is VALID [2022-02-20 19:43:37,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {12133#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {12133#false} is VALID [2022-02-20 19:43:37,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {12133#false} check_#res#1 := check_~tmp~1#1; {12133#false} is VALID [2022-02-20 19:43:37,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {12133#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {12133#false} is VALID [2022-02-20 19:43:37,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {12133#false} assume 0 == assert_~arg#1 % 256; {12133#false} is VALID [2022-02-20 19:43:37,394 INFO L290 TraceCheckUtils]: 51: Hoare triple {12133#false} assume !false; {12133#false} is VALID [2022-02-20 19:43:37,395 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:43:37,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:37,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11478635] [2022-02-20 19:43:37,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11478635] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:37,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:37,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:37,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178543523] [2022-02-20 19:43:37,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:37,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:37,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:37,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:37,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:37,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:37,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:37,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:37,426 INFO L87 Difference]: Start difference. First operand 863 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:39,146 INFO L93 Difference]: Finished difference Result 1011 states and 1826 transitions. [2022-02-20 19:43:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:39,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:39,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:43:40,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:40,588 INFO L225 Difference]: With dead ends: 1011 [2022-02-20 19:43:40,588 INFO L226 Difference]: Without dead ends: 931 [2022-02-20 19:43:40,588 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:43:40,589 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 1494 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1658 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:43:40,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 1658 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-02-20 19:43:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2022-02-20 19:43:40,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:40,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 931 states. Second operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,606 INFO L74 IsIncluded]: Start isIncluded. First operand 931 states. Second operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,608 INFO L87 Difference]: Start difference. First operand 931 states. Second operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:40,648 INFO L93 Difference]: Finished difference Result 931 states and 1698 transitions. [2022-02-20 19:43:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1698 transitions. [2022-02-20 19:43:40,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:40,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:40,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 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 931 states. [2022-02-20 19:43:40,652 INFO L87 Difference]: Start difference. First operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 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 931 states. [2022-02-20 19:43:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:40,681 INFO L93 Difference]: Finished difference Result 931 states and 1698 transitions. [2022-02-20 19:43:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1698 transitions. [2022-02-20 19:43:40,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:40,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:40,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:40,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 927 states have (on average 1.8306364617044228) internal successors, (1697), 928 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1697 transitions. [2022-02-20 19:43:40,716 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1697 transitions. Word has length 52 [2022-02-20 19:43:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:40,717 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1697 transitions. [2022-02-20 19:43:40,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1697 transitions. [2022-02-20 19:43:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:40,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:40,718 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] [2022-02-20 19:43:40,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:43:40,719 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash 919948555, now seen corresponding path program 1 times [2022-02-20 19:43:40,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:40,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989995700] [2022-02-20 19:43:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:40,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {16021#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(41, 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;~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; {16021#true} is VALID [2022-02-20 19:43:40,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {16021#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {16021#true} is VALID [2022-02-20 19:43:40,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {16021#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16021#true} is VALID [2022-02-20 19:43:40,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {16021#true} assume 0 == ~r1~0 % 256; {16021#true} is VALID [2022-02-20 19:43:40,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {16021#true} assume ~id1~0 >= 0; {16021#true} is VALID [2022-02-20 19:43:40,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {16021#true} assume 0 == ~st1~0; {16021#true} is VALID [2022-02-20 19:43:40,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {16021#true} assume ~send1~0 == ~id1~0; {16021#true} is VALID [2022-02-20 19:43:40,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {16021#true} assume 0 == ~mode1~0 % 256; {16021#true} is VALID [2022-02-20 19:43:40,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {16021#true} assume ~id2~0 >= 0; {16021#true} is VALID [2022-02-20 19:43:40,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {16021#true} assume 0 == ~st2~0; {16021#true} is VALID [2022-02-20 19:43:40,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {16021#true} assume ~send2~0 == ~id2~0; {16021#true} is VALID [2022-02-20 19:43:40,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {16021#true} assume 0 == ~mode2~0 % 256; {16021#true} is VALID [2022-02-20 19:43:40,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {16021#true} assume ~id3~0 >= 0; {16021#true} is VALID [2022-02-20 19:43:40,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {16021#true} assume 0 == ~st3~0; {16021#true} is VALID [2022-02-20 19:43:40,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {16021#true} assume ~send3~0 == ~id3~0; {16021#true} is VALID [2022-02-20 19:43:40,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {16021#true} assume 0 == ~mode3~0 % 256; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {16023#(= (+ (* (- 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;main1_~i2~0#1 := 0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {16023#(= (+ (* (- 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; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {16023#(= (+ (* (- 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; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {16023#(= (+ (* (- 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; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {16023#(= (+ (* (- 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; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {16023#(= (+ (* (- 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; {16023#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:40,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {16023#(= (+ (* (- 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; {16022#false} is VALID [2022-02-20 19:43:40,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {16022#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16022#false} is VALID [2022-02-20 19:43:40,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {16022#false} ~mode3~0 := 0; {16022#false} is VALID [2022-02-20 19:43:40,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {16022#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; {16022#false} is VALID [2022-02-20 19:43:40,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {16022#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16022#false} is VALID [2022-02-20 19:43:40,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {16022#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16022#false} is VALID [2022-02-20 19:43:40,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {16022#false} ~mode4~0 := 0; {16022#false} is VALID [2022-02-20 19:43:40,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {16022#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16022#false} is VALID [2022-02-20 19:43:40,806 INFO L290 TraceCheckUtils]: 47: Hoare triple {16022#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {16022#false} is VALID [2022-02-20 19:43:40,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {16022#false} check_#res#1 := check_~tmp~1#1; {16022#false} is VALID [2022-02-20 19:43:40,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {16022#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {16022#false} is VALID [2022-02-20 19:43:40,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {16022#false} assume 0 == assert_~arg#1 % 256; {16022#false} is VALID [2022-02-20 19:43:40,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {16022#false} assume !false; {16022#false} is VALID [2022-02-20 19:43:40,807 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:43:40,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:40,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989995700] [2022-02-20 19:43:40,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989995700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:40,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:40,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:40,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813054150] [2022-02-20 19:43:40,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:40,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:40,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:40,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:40,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:40,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:40,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:40,840 INFO L87 Difference]: Start difference. First operand 929 states and 1697 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:42,573 INFO L93 Difference]: Finished difference Result 1197 states and 2115 transitions. [2022-02-20 19:43:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:42,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:43:43,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:43,973 INFO L225 Difference]: With dead ends: 1197 [2022-02-20 19:43:43,973 INFO L226 Difference]: Without dead ends: 1051 [2022-02-20 19:43:43,974 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:43:43,975 INFO L933 BasicCegarLoop]: 1582 mSDtfsCounter, 1490 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1657 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:43:43,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 1657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2022-02-20 19:43:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1049. [2022-02-20 19:43:43,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:43,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1051 states. Second operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:43,993 INFO L74 IsIncluded]: Start isIncluded. First operand 1051 states. Second operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:43,997 INFO L87 Difference]: Start difference. First operand 1051 states. Second operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:44,031 INFO L93 Difference]: Finished difference Result 1051 states and 1882 transitions. [2022-02-20 19:43:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1882 transitions. [2022-02-20 19:43:44,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:44,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:44,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 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 1051 states. [2022-02-20 19:43:44,035 INFO L87 Difference]: Start difference. First operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 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 1051 states. [2022-02-20 19:43:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:44,070 INFO L93 Difference]: Finished difference Result 1051 states and 1882 transitions. [2022-02-20 19:43:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1882 transitions. [2022-02-20 19:43:44,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:44,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:44,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:44,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1047 states have (on average 1.7965616045845272) internal successors, (1881), 1048 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1881 transitions. [2022-02-20 19:43:44,109 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1881 transitions. Word has length 52 [2022-02-20 19:43:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:44,109 INFO L470 AbstractCegarLoop]: Abstraction has 1049 states and 1881 transitions. [2022-02-20 19:43:44,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1881 transitions. [2022-02-20 19:43:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:44,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:44,111 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] [2022-02-20 19:43:44,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:43:44,112 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1515907135, now seen corresponding path program 1 times [2022-02-20 19:43:44,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:44,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333618975] [2022-02-20 19:43:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:44,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {20526#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(41, 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;~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; {20526#true} is VALID [2022-02-20 19:43:44,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {20526#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {20526#true} is VALID [2022-02-20 19:43:44,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {20526#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20526#true} is VALID [2022-02-20 19:43:44,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {20526#true} assume 0 == ~r1~0 % 256; {20526#true} is VALID [2022-02-20 19:43:44,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {20526#true} assume ~id1~0 >= 0; {20526#true} is VALID [2022-02-20 19:43:44,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {20526#true} assume 0 == ~st1~0; {20526#true} is VALID [2022-02-20 19:43:44,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {20526#true} assume ~send1~0 == ~id1~0; {20526#true} is VALID [2022-02-20 19:43:44,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {20526#true} assume 0 == ~mode1~0 % 256; {20526#true} is VALID [2022-02-20 19:43:44,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {20526#true} assume ~id2~0 >= 0; {20526#true} is VALID [2022-02-20 19:43:44,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {20526#true} assume 0 == ~st2~0; {20526#true} is VALID [2022-02-20 19:43:44,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {20526#true} assume ~send2~0 == ~id2~0; {20526#true} is VALID [2022-02-20 19:43:44,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {20526#true} assume 0 == ~mode2~0 % 256; {20526#true} is VALID [2022-02-20 19:43:44,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {20526#true} assume ~id3~0 >= 0; {20526#true} is VALID [2022-02-20 19:43:44,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {20526#true} assume 0 == ~st3~0; {20526#true} is VALID [2022-02-20 19:43:44,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {20526#true} assume ~send3~0 == ~id3~0; {20526#true} is VALID [2022-02-20 19:43:44,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {20526#true} assume 0 == ~mode3~0 % 256; {20526#true} is VALID [2022-02-20 19:43:44,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {20526#true} assume ~id4~0 >= 0; {20526#true} is VALID [2022-02-20 19:43:44,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {20526#true} assume 0 == ~st4~0; {20526#true} is VALID [2022-02-20 19:43:44,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {20526#true} assume ~send4~0 == ~id4~0; {20526#true} is VALID [2022-02-20 19:43:44,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {20526#true} assume 0 == ~mode4~0 % 256; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {20528#(= (+ (* (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;main1_~i2~0#1 := 0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {20528#(= (+ (* (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; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {20528#(= (+ (* (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; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {20528#(= (+ (* (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; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {20528#(= (+ (* (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; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {20528#(= (+ (* (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; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {20528#(= (+ (* (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; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {20528#(= (+ (* (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; {20528#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:44,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {20528#(= (+ (* (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; {20527#false} is VALID [2022-02-20 19:43:44,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {20527#false} assume !(node4_~m4~0#1 != ~nomsg~0); {20527#false} is VALID [2022-02-20 19:43:44,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {20527#false} ~mode4~0 := 0; {20527#false} is VALID [2022-02-20 19:43:44,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {20527#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {20527#false} is VALID [2022-02-20 19:43:44,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {20527#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {20527#false} is VALID [2022-02-20 19:43:44,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {20527#false} check_#res#1 := check_~tmp~1#1; {20527#false} is VALID [2022-02-20 19:43:44,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {20527#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {20527#false} is VALID [2022-02-20 19:43:44,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {20527#false} assume 0 == assert_~arg#1 % 256; {20527#false} is VALID [2022-02-20 19:43:44,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {20527#false} assume !false; {20527#false} is VALID [2022-02-20 19:43:44,187 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:43:44,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:44,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333618975] [2022-02-20 19:43:44,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333618975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:44,188 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:44,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:44,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968445402] [2022-02-20 19:43:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:44,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:44,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:44,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:44,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:44,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:44,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:44,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:44,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:44,220 INFO L87 Difference]: Start difference. First operand 1049 states and 1881 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:45,924 INFO L93 Difference]: Finished difference Result 1533 states and 2627 transitions. [2022-02-20 19:43:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:45,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:43:45,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:43:47,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:47,379 INFO L225 Difference]: With dead ends: 1533 [2022-02-20 19:43:47,379 INFO L226 Difference]: Without dead ends: 1267 [2022-02-20 19:43:47,380 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:43:47,381 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1486 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1656 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:43:47,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 1656 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-02-20 19:43:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1265. [2022-02-20 19:43:47,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:47,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1267 states. Second operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:47,404 INFO L74 IsIncluded]: Start isIncluded. First operand 1267 states. Second operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:47,405 INFO L87 Difference]: Start difference. First operand 1267 states. Second operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:47,457 INFO L93 Difference]: Finished difference Result 1267 states and 2206 transitions. [2022-02-20 19:43:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2206 transitions. [2022-02-20 19:43:47,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:47,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:47,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 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 1267 states. [2022-02-20 19:43:47,463 INFO L87 Difference]: Start difference. First operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 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 1267 states. [2022-02-20 19:43:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:47,514 INFO L93 Difference]: Finished difference Result 1267 states and 2206 transitions. [2022-02-20 19:43:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2206 transitions. [2022-02-20 19:43:47,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:47,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:47,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:47,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1263 states have (on average 1.7458432304038005) internal successors, (2205), 1264 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2205 transitions. [2022-02-20 19:43:47,570 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2205 transitions. Word has length 52 [2022-02-20 19:43:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:47,571 INFO L470 AbstractCegarLoop]: Abstraction has 1265 states and 2205 transitions. [2022-02-20 19:43:47,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2205 transitions. [2022-02-20 19:43:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:43:47,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:47,572 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] [2022-02-20 19:43:47,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:43:47,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:47,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1924545907, now seen corresponding path program 1 times [2022-02-20 19:43:47,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:47,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645097] [2022-02-20 19:43:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:47,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:47,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {26155#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(41, 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;~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; {26155#true} is VALID [2022-02-20 19:43:47,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {26155#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {26155#true} is VALID [2022-02-20 19:43:47,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {26155#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {26155#true} is VALID [2022-02-20 19:43:47,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {26155#true} assume 0 == ~r1~0 % 256; {26155#true} is VALID [2022-02-20 19:43:47,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {26155#true} assume ~id1~0 >= 0; {26155#true} is VALID [2022-02-20 19:43:47,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {26155#true} assume 0 == ~st1~0; {26157#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:47,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {26157#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {26157#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:47,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {26157#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {26157#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:47,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {26157#(<= ~st1~0 0)} assume ~id2~0 >= 0; {26157#(<= ~st1~0 0)} is VALID [2022-02-20 19:43:47,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {26157#(<= ~st1~0 0)} assume 0 == ~st2~0; {26158#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {26158#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {26158#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {26158#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {26158#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {26158#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {26158#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {26158#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {26159#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {26159#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {26159#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {26159#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {26159#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {26159#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {26159#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {26159#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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;main1_~i2~0#1 := 0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:43:47,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {26160#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {26156#false} is VALID [2022-02-20 19:43:47,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {26156#false} check_#res#1 := check_~tmp~1#1; {26156#false} is VALID [2022-02-20 19:43:47,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {26156#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {26156#false} is VALID [2022-02-20 19:43:47,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {26156#false} assume 0 == assert_~arg#1 % 256; {26156#false} is VALID [2022-02-20 19:43:47,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {26156#false} assume !false; {26156#false} is VALID [2022-02-20 19:43:47,664 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:43:47,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:47,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645097] [2022-02-20 19:43:47,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:47,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:47,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:43:47,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106750775] [2022-02-20 19:43:47,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:47,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:47,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:47,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:47,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:47,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:47,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:47,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:47,695 INFO L87 Difference]: Start difference. First operand 1265 states and 2205 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:52,297 INFO L93 Difference]: Finished difference Result 5121 states and 8101 transitions. [2022-02-20 19:43:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:43:52,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:43:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:43:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:43:52,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2089 transitions. [2022-02-20 19:43:53,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2089 edges. 2089 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:54,792 INFO L225 Difference]: With dead ends: 5121 [2022-02-20 19:43:54,792 INFO L226 Difference]: Without dead ends: 4639 [2022-02-20 19:43:54,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:43:54,796 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 6521 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6521 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:54,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6521 Valid, 2068 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2022-02-20 19:43:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 1745. [2022-02-20 19:43:55,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:55,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4639 states. Second operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:55,199 INFO L74 IsIncluded]: Start isIncluded. First operand 4639 states. Second operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:55,201 INFO L87 Difference]: Start difference. First operand 4639 states. Second operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:55,817 INFO L93 Difference]: Finished difference Result 4639 states and 7236 transitions. [2022-02-20 19:43:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 7236 transitions. [2022-02-20 19:43:55,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:55,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:55,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 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 4639 states. [2022-02-20 19:43:55,828 INFO L87 Difference]: Start difference. First operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 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 4639 states. [2022-02-20 19:43:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:56,476 INFO L93 Difference]: Finished difference Result 4639 states and 7236 transitions. [2022-02-20 19:43:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 7236 transitions. [2022-02-20 19:43:56,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:56,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:56,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:56,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1743 states have (on average 1.6689615605278256) internal successors, (2909), 1744 states have internal predecessors, (2909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2909 transitions. [2022-02-20 19:43:56,585 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2909 transitions. Word has length 52 [2022-02-20 19:43:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:56,586 INFO L470 AbstractCegarLoop]: Abstraction has 1745 states and 2909 transitions. [2022-02-20 19:43:56,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2909 transitions. [2022-02-20 19:43:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:56,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:56,586 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] [2022-02-20 19:43:56,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:43:56,587 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1236981091, now seen corresponding path program 1 times [2022-02-20 19:43:56,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:56,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978807836] [2022-02-20 19:43:56,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:56,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {43562#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(41, 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;~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; {43562#true} is VALID [2022-02-20 19:43:56,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {43562#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {43562#true} is VALID [2022-02-20 19:43:56,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {43562#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {43562#true} is VALID [2022-02-20 19:43:56,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {43562#true} assume 0 == ~r1~0 % 256; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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;main1_~i2~0#1 := 0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:43:56,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {43564#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {43563#false} is VALID [2022-02-20 19:43:56,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {43563#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {43563#false} is VALID [2022-02-20 19:43:56,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {43563#false} check_#res#1 := check_~tmp~1#1; {43563#false} is VALID [2022-02-20 19:43:56,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {43563#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {43563#false} is VALID [2022-02-20 19:43:56,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {43563#false} assume 0 == assert_~arg#1 % 256; {43563#false} is VALID [2022-02-20 19:43:56,667 INFO L290 TraceCheckUtils]: 53: Hoare triple {43563#false} assume !false; {43563#false} is VALID [2022-02-20 19:43:56,667 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:43:56,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:56,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978807836] [2022-02-20 19:43:56,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978807836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:56,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:56,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:56,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710494906] [2022-02-20 19:43:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:56,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:56,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:56,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:56,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:56,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:56,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:56,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:56,709 INFO L87 Difference]: Start difference. First operand 1745 states and 2909 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:58,933 INFO L93 Difference]: Finished difference Result 3151 states and 5009 transitions. [2022-02-20 19:43:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:58,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:43:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1666 transitions. [2022-02-20 19:43:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1666 transitions. [2022-02-20 19:43:58,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1666 transitions. [2022-02-20 19:44:00,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1666 edges. 1666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:00,436 INFO L225 Difference]: With dead ends: 3151 [2022-02-20 19:44:00,437 INFO L226 Difference]: Without dead ends: 2189 [2022-02-20 19:44:00,438 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:44:00,438 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1478 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:00,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 1623 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2022-02-20 19:44:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2187. [2022-02-20 19:44:01,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:01,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:01,056 INFO L74 IsIncluded]: Start isIncluded. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:01,058 INFO L87 Difference]: Start difference. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:01,191 INFO L93 Difference]: Finished difference Result 2189 states and 3544 transitions. [2022-02-20 19:44:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3544 transitions. [2022-02-20 19:44:01,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:01,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:01,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 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 2189 states. [2022-02-20 19:44:01,198 INFO L87 Difference]: Start difference. First operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 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 2189 states. [2022-02-20 19:44:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:01,354 INFO L93 Difference]: Finished difference Result 2189 states and 3544 transitions. [2022-02-20 19:44:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3544 transitions. [2022-02-20 19:44:01,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:01,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:01,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:01,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.6215102974828375) internal successors, (3543), 2186 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3543 transitions. [2022-02-20 19:44:01,513 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3543 transitions. Word has length 54 [2022-02-20 19:44:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:01,514 INFO L470 AbstractCegarLoop]: Abstraction has 2187 states and 3543 transitions. [2022-02-20 19:44:01,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3543 transitions. [2022-02-20 19:44:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:44:01,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:01,515 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] [2022-02-20 19:44:01,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:44:01,515 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:01,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1303474603, now seen corresponding path program 1 times [2022-02-20 19:44:01,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:01,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849349649] [2022-02-20 19:44:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:01,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {54177#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(41, 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;~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; {54177#true} is VALID [2022-02-20 19:44:01,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {54177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {54177#true} is VALID [2022-02-20 19:44:01,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {54177#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {54177#true} is VALID [2022-02-20 19:44:01,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {54177#true} assume 0 == ~r1~0 % 256; {54177#true} is VALID [2022-02-20 19:44:01,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {54177#true} assume ~id1~0 >= 0; {54177#true} is VALID [2022-02-20 19:44:01,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {54177#true} assume 0 == ~st1~0; {54179#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:44:01,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {54179#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {54179#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:44:01,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {54179#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {54179#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:44:01,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {54179#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {54179#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:44:01,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {54179#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {54180#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:44:01,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {54180#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {54180#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:44:01,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {54180#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {54180#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:44:01,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {54180#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {54180#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:44:01,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {54180#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {54181#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:44:01,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {54181#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {54181#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:44:01,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {54181#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {54181#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:44:01,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {54181#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {54181#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:44:01,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {54181#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == assume_abort_if_not_~cond#1); {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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;main1_~i2~0#1 := 0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:44:01,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {54182#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {54178#false} is VALID [2022-02-20 19:44:01,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {54178#false} check_#res#1 := check_~tmp~1#1; {54178#false} is VALID [2022-02-20 19:44:01,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {54178#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {54178#false} is VALID [2022-02-20 19:44:01,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {54178#false} assume 0 == assert_~arg#1 % 256; {54178#false} is VALID [2022-02-20 19:44:01,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {54178#false} assume !false; {54178#false} is VALID [2022-02-20 19:44:01,720 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:44:01,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:01,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849349649] [2022-02-20 19:44:01,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849349649] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:01,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:01,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:44:01,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494948265] [2022-02-20 19:44:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:01,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:44:01,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:01,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:01,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:01,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:44:01,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:01,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:44:01,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:44:01,773 INFO L87 Difference]: Start difference. First operand 2187 states and 3543 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:05,373 INFO L93 Difference]: Finished difference Result 3591 states and 5617 transitions. [2022-02-20 19:44:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:44:05,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 19:44:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2022-02-20 19:44:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2022-02-20 19:44:05,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1673 transitions. [2022-02-20 19:44:06,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1673 edges. 1673 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:06,925 INFO L225 Difference]: With dead ends: 3591 [2022-02-20 19:44:06,925 INFO L226 Difference]: Without dead ends: 2189 [2022-02-20 19:44:06,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:44:06,927 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 3072 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3072 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:06,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3072 Valid, 1726 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2022-02-20 19:44:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2187. [2022-02-20 19:44:07,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:07,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:07,565 INFO L74 IsIncluded]: Start isIncluded. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:07,567 INFO L87 Difference]: Start difference. First operand 2189 states. Second operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:07,697 INFO L93 Difference]: Finished difference Result 2189 states and 3520 transitions. [2022-02-20 19:44:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3520 transitions. [2022-02-20 19:44:07,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:07,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:07,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 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 2189 states. [2022-02-20 19:44:07,704 INFO L87 Difference]: Start difference. First operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 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 2189 states. [2022-02-20 19:44:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:07,826 INFO L93 Difference]: Finished difference Result 2189 states and 3520 transitions. [2022-02-20 19:44:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3520 transitions. [2022-02-20 19:44:07,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:07,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:07,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:07,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.6105263157894736) internal successors, (3519), 2186 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3519 transitions. [2022-02-20 19:44:08,000 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3519 transitions. Word has length 54 [2022-02-20 19:44:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:08,000 INFO L470 AbstractCegarLoop]: Abstraction has 2187 states and 3519 transitions. [2022-02-20 19:44:08,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3519 transitions. [2022-02-20 19:44:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:44:08,000 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:08,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:08,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:44:08,001 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1338283904, now seen corresponding path program 1 times [2022-02-20 19:44:08,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:08,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864011256] [2022-02-20 19:44:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:08,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {65343#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(41, 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;~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; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, 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~ret26#1, main1_#t~ret27#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~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {65345#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:44:08,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {65345#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {65346#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 19:44:08,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {65346#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {65346#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 19:44:08,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {65346#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} init_#res#1 := init_~tmp~0#1; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#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; {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == assume_abort_if_not_~cond#1); {65347#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:44:08,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {65347#(<= (+ ~nomsg~0 1) ~send4~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;main1_~i2~0#1 := 0; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode1~0 % 256); {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode2~0 % 256); {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode3~0 % 256); {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~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; {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode4~0 % 256); {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:44:08,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {65348#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {65344#false} is VALID [2022-02-20 19:44:08,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {65344#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {65344#false} is VALID [2022-02-20 19:44:08,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {65344#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {65344#false} is VALID [2022-02-20 19:44:08,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {65344#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {65344#false} is VALID [2022-02-20 19:44:08,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {65344#false} assume !(~r1~0 % 256 >= 4); {65344#false} is VALID [2022-02-20 19:44:08,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {65344#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {65344#false} is VALID [2022-02-20 19:44:08,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {65344#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {65344#false} is VALID [2022-02-20 19:44:08,072 INFO L290 TraceCheckUtils]: 51: Hoare triple {65344#false} check_#res#1 := check_~tmp~1#1; {65344#false} is VALID [2022-02-20 19:44:08,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {65344#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#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; {65344#false} is VALID [2022-02-20 19:44:08,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {65344#false} assume 0 == assert_~arg#1 % 256; {65344#false} is VALID [2022-02-20 19:44:08,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {65344#false} assume !false; {65344#false} is VALID [2022-02-20 19:44:08,073 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:44:08,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:08,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864011256] [2022-02-20 19:44:08,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864011256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:08,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:08,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:44:08,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38382177] [2022-02-20 19:44:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:08,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:44:08,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:08,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:08,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:08,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:44:08,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:44:08,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:44:08,108 INFO L87 Difference]: Start difference. First operand 2187 states and 3519 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:12,532 INFO L93 Difference]: Finished difference Result 3589 states and 5568 transitions. [2022-02-20 19:44:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:44:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:44:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2022-02-20 19:44:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2022-02-20 19:44:12,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1607 transitions.