./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label04.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/eca-rers2012/Problem13_label04.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 2adccaef3712b0295c8f7cfd3e1ed73b8b25a6bf1026bcea89334476cfd41a2b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 15:33:14,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 15:33:14,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 15:33:14,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 15:33:14,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 15:33:14,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 15:33:14,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 15:33:14,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 15:33:14,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 15:33:14,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 15:33:14,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 15:33:14,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 15:33:14,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 15:33:14,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 15:33:14,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 15:33:14,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 15:33:14,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 15:33:14,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 15:33:14,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 15:33:14,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 15:33:14,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 15:33:14,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 15:33:14,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 15:33:14,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 15:33:14,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 15:33:14,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 15:33:14,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 15:33:14,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 15:33:14,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 15:33:14,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 15:33:14,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 15:33:14,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 15:33:14,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 15:33:14,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 15:33:14,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 15:33:14,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 15:33:14,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 15:33:14,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 15:33:14,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 15:33:14,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 15:33:14,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 15:33:14,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 15:33:14,273 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 15:33:14,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 15:33:14,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 15:33:14,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 15:33:14,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 15:33:14,276 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 15:33:14,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 15:33:14,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 15:33:14,277 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 15:33:14,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 15:33:14,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 15:33:14,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 15:33:14,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 15:33:14,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 15:33:14,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 15:33:14,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 15:33:14,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 15:33:14,279 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 15:33:14,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 15:33:14,279 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 15:33:14,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 15:33:14,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 15:33:14,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 15:33:14,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 15:33:14,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:33:14,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 15:33:14,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 15:33:14,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 15:33:14,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 15:33:14,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 15:33:14,281 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 15:33:14,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 15:33:14,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 15:33:14,282 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 -> 2adccaef3712b0295c8f7cfd3e1ed73b8b25a6bf1026bcea89334476cfd41a2b [2022-02-20 15:33:14,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 15:33:14,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 15:33:14,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 15:33:14,474 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 15:33:14,475 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 15:33:14,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label04.c [2022-02-20 15:33:14,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc963dd5/10784c95b8fd4fc2bfaae798a18b17ba/FLAG0ea8c31da [2022-02-20 15:33:15,209 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 15:33:15,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label04.c [2022-02-20 15:33:15,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc963dd5/10784c95b8fd4fc2bfaae798a18b17ba/FLAG0ea8c31da [2022-02-20 15:33:15,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc963dd5/10784c95b8fd4fc2bfaae798a18b17ba [2022-02-20 15:33:15,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 15:33:15,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 15:33:15,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 15:33:15,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 15:33:15,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 15:33:15,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:33:15" (1/1) ... [2022-02-20 15:33:15,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1bc3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:15, skipping insertion in model container [2022-02-20 15:33:15,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:33:15" (1/1) ... [2022-02-20 15:33:15,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 15:33:15,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 15:33:15,701 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/eca-rers2012/Problem13_label04.c[2611,2624] [2022-02-20 15:33:16,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:33:16,612 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 15:33:16,636 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/eca-rers2012/Problem13_label04.c[2611,2624] [2022-02-20 15:33:17,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:33:17,149 INFO L208 MainTranslator]: Completed translation [2022-02-20 15:33:17,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17 WrapperNode [2022-02-20 15:33:17,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 15:33:17,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 15:33:17,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 15:33:17,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 15:33:17,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:17,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:17,833 INFO L137 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5583 [2022-02-20 15:33:17,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 15:33:17,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 15:33:17,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 15:33:17,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 15:33:17,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:17,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:18,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:18,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:18,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:18,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:18,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:18,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 15:33:18,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 15:33:18,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 15:33:18,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 15:33:18,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (1/1) ... [2022-02-20 15:33:18,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:33:18,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 15:33:18,424 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 15:33:18,431 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 15:33:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 15:33:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 15:33:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 15:33:18,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 15:33:18,518 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 15:33:18,519 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 15:33:28,558 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 15:33:28,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 15:33:28,574 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 15:33:28,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:33:28 BoogieIcfgContainer [2022-02-20 15:33:28,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 15:33:28,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 15:33:28,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 15:33:28,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 15:33:28,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 03:33:15" (1/3) ... [2022-02-20 15:33:28,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181354c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:33:28, skipping insertion in model container [2022-02-20 15:33:28,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:17" (2/3) ... [2022-02-20 15:33:28,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181354c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:33:28, skipping insertion in model container [2022-02-20 15:33:28,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:33:28" (3/3) ... [2022-02-20 15:33:28,593 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem13_label04.c [2022-02-20 15:33:28,598 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 15:33:28,598 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 15:33:28,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 15:33:28,654 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 15:33:28,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 15:33:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 15:33:28,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:33:28,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:33:28,710 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:33:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:33:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1657508526, now seen corresponding path program 1 times [2022-02-20 15:33:28,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:33:28,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634104394] [2022-02-20 15:33:28,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:33:28,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:33:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:33:28,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {1101#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(20, 2);call #Ultimate.allocInit(12, 3);~inputB~0 := 2;~inputE~0 := 5;~inputC~0 := 3;~inputD~0 := 4;~inputF~0 := 6;~a26~0 := 1;~a13~0 := 0;~a19~0 := 9;~a23~0 := 158;~a12~0 := 286;~a1~0 := 2; {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1103#(<= ~a13~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1103#(<= ~a13~0 0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {1103#(<= ~a13~0 0)} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {1103#(<= ~a13~0 0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {1103#(<= ~a13~0 0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {1103#(<= ~a13~0 0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {1103#(<= ~a13~0 0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {1103#(<= ~a13~0 0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {1103#(<= ~a13~0 0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {1103#(<= ~a13~0 0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {1103#(<= ~a13~0 0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {1103#(<= ~a13~0 0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {1103#(<= ~a13~0 0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a13~0 0)} is VALID [2022-02-20 15:33:28,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {1103#(<= ~a13~0 0)} assume ((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0; {1102#false} is VALID [2022-02-20 15:33:28,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#false} assume !false; {1102#false} is VALID [2022-02-20 15:33:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:33:28,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:33:28,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634104394] [2022-02-20 15:33:28,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634104394] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:33:28,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:33:28,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:33:28,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985408765] [2022-02-20 15:33:28,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:33:28,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 15:33:28,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:33:28,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:28,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:28,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:33:28,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:33:29,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:33:29,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:29,019 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:36,267 INFO L93 Difference]: Finished difference Result 3147 states and 5806 transitions. [2022-02-20 15:33:36,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:33:36,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 15:33:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:33:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5806 transitions. [2022-02-20 15:33:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5806 transitions. [2022-02-20 15:33:36,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5806 transitions. [2022-02-20 15:33:41,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5806 edges. 5806 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:41,402 INFO L225 Difference]: With dead ends: 3147 [2022-02-20 15:33:41,403 INFO L226 Difference]: Without dead ends: 1964 [2022-02-20 15:33:41,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:41,412 INFO L933 BasicCegarLoop]: 764 mSDtfsCounter, 1163 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-20 15:33:41,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1163 Valid, 992 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-02-20 15:33:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2022-02-20 15:33:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2022-02-20 15:33:41,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:33:41,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1964 states. Second operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:41,557 INFO L74 IsIncluded]: Start isIncluded. First operand 1964 states. Second operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:41,561 INFO L87 Difference]: Start difference. First operand 1964 states. Second operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:41,730 INFO L93 Difference]: Finished difference Result 1964 states and 3251 transitions. [2022-02-20 15:33:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3251 transitions. [2022-02-20 15:33:41,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:33:41,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:33:41,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 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 1964 states. [2022-02-20 15:33:41,749 INFO L87 Difference]: Start difference. First operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 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 1964 states. [2022-02-20 15:33:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:41,908 INFO L93 Difference]: Finished difference Result 1964 states and 3251 transitions. [2022-02-20 15:33:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3251 transitions. [2022-02-20 15:33:41,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:33:41,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:33:41,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:33:41,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:33:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2022-02-20 15:33:42,071 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 16 [2022-02-20 15:33:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:33:42,072 INFO L470 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2022-02-20 15:33:42,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2022-02-20 15:33:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-20 15:33:42,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:33:42,075 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:33:42,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 15:33:42,078 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:33:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:33:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -9926837, now seen corresponding path program 1 times [2022-02-20 15:33:42,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:33:42,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34134387] [2022-02-20 15:33:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:33:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:33:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:33:42,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {10160#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(20, 2);call #Ultimate.allocInit(12, 3);~inputB~0 := 2;~inputE~0 := 5;~inputC~0 := 3;~inputD~0 := 4;~inputF~0 := 6;~a26~0 := 1;~a13~0 := 0;~a19~0 := 9;~a23~0 := 158;~a12~0 := 286;~a1~0 := 2; {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {10162#(<= ~a12~0 286)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {10162#(<= ~a12~0 286)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {10162#(<= ~a12~0 286)} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {10162#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {10162#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {10162#(<= ~a12~0 286)} assume !(1 == ~a26~0 && (((5 == calculate_output_~input#1 && ((((264 < ~a23~0 && 476 >= ~a23~0) && 10 == ~a19~0) || (476 < ~a23~0 && 10 == ~a19~0)) || (~a23~0 <= 95 && 11 == ~a19~0))) && 178 < ~a12~0 && 395 >= ~a12~0) && 3 == ~a1~0) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {10162#(<= ~a12~0 286)} assume !(13 == ~a19~0 && (395 < ~a12~0 && 441 >= ~a12~0) && 3 == ~a1~0 && 1 == ~a26~0 && (4 == calculate_output_~input#1 && (~a23~0 <= 95 || (95 < ~a23~0 && 264 >= ~a23~0))) && 1 == ~a13~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {10162#(<= ~a12~0 286)} assume !(((2 == ~a1~0 && (2 == calculate_output_~input#1 && ((12 == ~a19~0 && ~a23~0 <= 95) || (11 == ~a19~0 && 264 < ~a23~0 && 476 >= ~a23~0) || (476 < ~a23~0 && 11 == ~a19~0))) && !(1 == ~a13~0)) && 441 < ~a12~0) && 1 == ~a26~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {10162#(<= ~a12~0 286)} assume !((1 == ~a26~0 && (1 == ~a13~0 && 2 == calculate_output_~input#1 && ((~a23~0 <= 95 && 13 == ~a19~0) || (12 == ~a19~0 && 264 < ~a23~0 && 476 >= ~a23~0) || (12 == ~a19~0 && 476 < ~a23~0))) && ~a12~0 <= 178) && 3 == ~a1~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {10162#(<= ~a12~0 286)} assume !(((1 == ~a26~0 && (11 == ~a19~0 && 2 == ~a1~0 && 6 == calculate_output_~input#1) && 441 < ~a12~0) && 1 == ~a13~0) && 95 < ~a23~0 && 264 >= ~a23~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {10162#(<= ~a12~0 286)} assume !(~a12~0 <= 178 && !(1 == ~a13~0) && 1 == ~a26~0 && (2 == calculate_output_~input#1 && ((13 == ~a19~0 && ~a23~0 <= 95) || ((264 < ~a23~0 && 476 >= ~a23~0) && 12 == ~a19~0) || (12 == ~a19~0 && 476 < ~a23~0))) && 3 == ~a1~0); {10162#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:42,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {10162#(<= ~a12~0 286)} assume (((2 == ~a1~0 && (((476 < ~a23~0 && 10 == ~a19~0) || (11 == ~a19~0 && ~a23~0 <= 95)) || ((95 < ~a23~0 && 264 >= ~a23~0) && 11 == ~a19~0)) && 3 == calculate_output_~input#1) && 395 < ~a12~0 && 441 >= ~a12~0) && 1 == ~a26~0) && !(1 == ~a13~0);~a12~0 := 5 * (if (if ~a12~0 < 0 && 0 != ~a12~0 % 5 then 1 + ~a12~0 / 5 else ~a12~0 / 5) < 0 && 0 != (if ~a12~0 < 0 && 0 != ~a12~0 % 5 then 1 + ~a12~0 / 5 else ~a12~0 / 5) % 5 then 1 + (if ~a12~0 < 0 && 0 != ~a12~0 % 5 then 1 + ~a12~0 / 5 else ~a12~0 / 5) / 5 else (if ~a12~0 < 0 && 0 != ~a12~0 % 5 then 1 + ~a12~0 / 5 else ~a12~0 / 5) / 5) - -206;~a23~0 := (if -320493 + (if ~a23~0 < 0 && 0 != ~a23~0 % 5 then 1 + ~a23~0 / 5 else ~a23~0 / 5) < 0 && 0 != (-320493 + (if ~a23~0 < 0 && 0 != ~a23~0 % 5 then 1 + ~a23~0 / 5 else ~a23~0 / 5)) % 84 then (-320493 + (if ~a23~0 < 0 && 0 != ~a23~0 % 5 then 1 + ~a23~0 / 5 else ~a23~0 / 5)) % 84 - 84 else (-320493 + (if ~a23~0 < 0 && 0 != ~a23~0 % 5 then 1 + ~a23~0 / 5 else ~a23~0 / 5)) % 84) - -228;~a19~0 := 10;~a13~0 := 1;calculate_output_#res#1 := -1; {10161#false} is VALID [2022-02-20 15:33:42,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {10161#false} main_#t~ret13#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_~output~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {10161#false} is VALID [2022-02-20 15:33:42,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {10161#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10161#false} is VALID [2022-02-20 15:33:42,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {10161#false} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {10161#false} is VALID [2022-02-20 15:33:42,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {10161#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10161#false} is VALID [2022-02-20 15:33:42,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {10161#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10161#false} is VALID [2022-02-20 15:33:42,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {10161#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10161#false} is VALID [2022-02-20 15:33:42,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {10161#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10161#false} is VALID [2022-02-20 15:33:42,332 INFO L290 TraceCheckUtils]: 79: Hoare triple {10161#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10161#false} is VALID [2022-02-20 15:33:42,332 INFO L290 TraceCheckUtils]: 80: Hoare triple {10161#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10161#false} is VALID [2022-02-20 15:33:42,332 INFO L290 TraceCheckUtils]: 81: Hoare triple {10161#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10161#false} is VALID [2022-02-20 15:33:42,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {10161#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10161#false} is VALID [2022-02-20 15:33:42,332 INFO L290 TraceCheckUtils]: 83: Hoare triple {10161#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10161#false} is VALID [2022-02-20 15:33:42,333 INFO L290 TraceCheckUtils]: 84: Hoare triple {10161#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10161#false} is VALID [2022-02-20 15:33:42,333 INFO L290 TraceCheckUtils]: 85: Hoare triple {10161#false} assume ((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0; {10161#false} is VALID [2022-02-20 15:33:42,333 INFO L290 TraceCheckUtils]: 86: Hoare triple {10161#false} assume !false; {10161#false} is VALID [2022-02-20 15:33:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:33:42,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:33:42,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34134387] [2022-02-20 15:33:42,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34134387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:33:42,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:33:42,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:33:42,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278872937] [2022-02-20 15:33:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:33:42,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 15:33:42,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:33:42,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:42,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:42,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:33:42,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:33:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:33:42,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:42,433 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:49,923 INFO L93 Difference]: Finished difference Result 5540 states and 9221 transitions. [2022-02-20 15:33:49,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:33:49,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 15:33:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:33:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5329 transitions. [2022-02-20 15:33:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5329 transitions. [2022-02-20 15:33:49,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5329 transitions. [2022-02-20 15:33:54,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5329 edges. 5329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:54,553 INFO L225 Difference]: With dead ends: 5540 [2022-02-20 15:33:54,554 INFO L226 Difference]: Without dead ends: 3591 [2022-02-20 15:33:54,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:54,556 INFO L933 BasicCegarLoop]: 871 mSDtfsCounter, 923 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-20 15:33:54,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-02-20 15:33:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2022-02-20 15:33:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3581. [2022-02-20 15:33:54,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:33:54,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3591 states. Second operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:54,650 INFO L74 IsIncluded]: Start isIncluded. First operand 3591 states. Second operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:54,669 INFO L87 Difference]: Start difference. First operand 3591 states. Second operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:55,215 INFO L93 Difference]: Finished difference Result 3591 states and 5407 transitions. [2022-02-20 15:33:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 5407 transitions. [2022-02-20 15:33:55,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:33:55,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:33:55,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 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 3591 states. [2022-02-20 15:33:55,233 INFO L87 Difference]: Start difference. First operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 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 3591 states. [2022-02-20 15:33:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:55,721 INFO L93 Difference]: Finished difference Result 3591 states and 5407 transitions. [2022-02-20 15:33:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 5407 transitions. [2022-02-20 15:33:55,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:33:55,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:33:55,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:33:55,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:33:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2022-02-20 15:33:56,125 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 87 [2022-02-20 15:33:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:33:56,125 INFO L470 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2022-02-20 15:33:56,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2022-02-20 15:33:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 15:33:56,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:33:56,128 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:33:56,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 15:33:56,128 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:33:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:33:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash 152230728, now seen corresponding path program 1 times [2022-02-20 15:33:56,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:33:56,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582568009] [2022-02-20 15:33:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:33:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:33:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:33:56,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {26518#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(20, 2);call #Ultimate.allocInit(12, 3);~inputB~0 := 2;~inputE~0 := 5;~inputC~0 := 3;~inputD~0 := 4;~inputF~0 := 6;~a26~0 := 1;~a13~0 := 0;~a19~0 := 9;~a23~0 := 158;~a12~0 := 286;~a1~0 := 2; {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {26520#(<= ~a19~0 9)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {26520#(<= ~a19~0 9)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {26520#(<= ~a19~0 9)} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,316 INFO L290 TraceCheckUtils]: 60: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,317 INFO L290 TraceCheckUtils]: 63: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,317 INFO L290 TraceCheckUtils]: 64: Hoare triple {26520#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,317 INFO L290 TraceCheckUtils]: 65: Hoare triple {26520#(<= ~a19~0 9)} assume !(1 == ~a26~0 && (((5 == calculate_output_~input#1 && ((((264 < ~a23~0 && 476 >= ~a23~0) && 10 == ~a19~0) || (476 < ~a23~0 && 10 == ~a19~0)) || (~a23~0 <= 95 && 11 == ~a19~0))) && 178 < ~a12~0 && 395 >= ~a12~0) && 3 == ~a1~0) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {26520#(<= ~a19~0 9)} assume !(13 == ~a19~0 && (395 < ~a12~0 && 441 >= ~a12~0) && 3 == ~a1~0 && 1 == ~a26~0 && (4 == calculate_output_~input#1 && (~a23~0 <= 95 || (95 < ~a23~0 && 264 >= ~a23~0))) && 1 == ~a13~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {26520#(<= ~a19~0 9)} assume !(((2 == ~a1~0 && (2 == calculate_output_~input#1 && ((12 == ~a19~0 && ~a23~0 <= 95) || (11 == ~a19~0 && 264 < ~a23~0 && 476 >= ~a23~0) || (476 < ~a23~0 && 11 == ~a19~0))) && !(1 == ~a13~0)) && 441 < ~a12~0) && 1 == ~a26~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {26520#(<= ~a19~0 9)} assume !((1 == ~a26~0 && (1 == ~a13~0 && 2 == calculate_output_~input#1 && ((~a23~0 <= 95 && 13 == ~a19~0) || (12 == ~a19~0 && 264 < ~a23~0 && 476 >= ~a23~0) || (12 == ~a19~0 && 476 < ~a23~0))) && ~a12~0 <= 178) && 3 == ~a1~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {26520#(<= ~a19~0 9)} assume !(((1 == ~a26~0 && (11 == ~a19~0 && 2 == ~a1~0 && 6 == calculate_output_~input#1) && 441 < ~a12~0) && 1 == ~a13~0) && 95 < ~a23~0 && 264 >= ~a23~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {26520#(<= ~a19~0 9)} assume !(~a12~0 <= 178 && !(1 == ~a13~0) && 1 == ~a26~0 && (2 == calculate_output_~input#1 && ((13 == ~a19~0 && ~a23~0 <= 95) || ((264 < ~a23~0 && 476 >= ~a23~0) && 12 == ~a19~0) || (12 == ~a19~0 && 476 < ~a23~0))) && 3 == ~a1~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {26520#(<= ~a19~0 9)} assume !((((2 == ~a1~0 && (((476 < ~a23~0 && 10 == ~a19~0) || (11 == ~a19~0 && ~a23~0 <= 95)) || ((95 < ~a23~0 && 264 >= ~a23~0) && 11 == ~a19~0)) && 3 == calculate_output_~input#1) && 395 < ~a12~0 && 441 >= ~a12~0) && 1 == ~a26~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,320 INFO L290 TraceCheckUtils]: 72: Hoare triple {26520#(<= ~a19~0 9)} assume !((178 < ~a12~0 && 395 >= ~a12~0) && 1 == ~a26~0 && (9 == ~a19~0 && (6 == calculate_output_~input#1 && 1 == ~a13~0) && 3 == ~a1~0) && 476 < ~a23~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,321 INFO L290 TraceCheckUtils]: 73: Hoare triple {26520#(<= ~a19~0 9)} assume !(((95 < ~a23~0 && 264 >= ~a23~0) && (!(1 == ~a13~0) && 11 == ~a19~0 && 1 == ~a26~0 && 4 == calculate_output_~input#1) && 178 < ~a12~0 && 395 >= ~a12~0) && 2 == ~a1~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,321 INFO L290 TraceCheckUtils]: 74: Hoare triple {26520#(<= ~a19~0 9)} assume !(1 == ~a26~0 && (((13 == ~a19~0 && ((264 < ~a23~0 && 476 >= ~a23~0) || 476 < ~a23~0) && 6 == calculate_output_~input#1) && ~a12~0 <= 178) && !(1 == ~a13~0)) && 3 == ~a1~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,322 INFO L290 TraceCheckUtils]: 75: Hoare triple {26520#(<= ~a19~0 9)} assume !(((1 == ~a26~0 && (441 < ~a12~0 && !(1 == ~a13~0) && 2 == calculate_output_~input#1) && 95 < ~a23~0 && 264 >= ~a23~0) && 3 == ~a1~0) && 13 == ~a19~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,322 INFO L290 TraceCheckUtils]: 76: Hoare triple {26520#(<= ~a19~0 9)} assume !(13 == ~a19~0 && ((3 == ~a1~0 && (((264 < ~a23~0 && 476 >= ~a23~0) || 476 < ~a23~0) && 3 == calculate_output_~input#1) && 441 < ~a12~0) && 1 == ~a26~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,322 INFO L290 TraceCheckUtils]: 77: Hoare triple {26520#(<= ~a19~0 9)} assume !(11 == ~a19~0 && 1 == ~a26~0 && (476 < ~a23~0 && (395 < ~a12~0 && 441 >= ~a12~0) && 3 == ~a1~0 && 2 == calculate_output_~input#1) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,323 INFO L290 TraceCheckUtils]: 78: Hoare triple {26520#(<= ~a19~0 9)} assume !(3 == ~a1~0 && 1 == ~a26~0 && ((13 == ~a19~0 && 3 == calculate_output_~input#1 && (~a23~0 <= 95 || (95 < ~a23~0 && 264 >= ~a23~0))) && 178 < ~a12~0 && 395 >= ~a12~0) && !(1 == ~a13~0)); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {26520#(<= ~a19~0 9)} assume !(1 == ~a26~0 && (((((11 == ~a19~0 && 95 < ~a23~0 && 264 >= ~a23~0) || (476 < ~a23~0 && 10 == ~a19~0) || (11 == ~a19~0 && ~a23~0 <= 95)) && 6 == calculate_output_~input#1) && !(1 == ~a13~0)) && 395 < ~a12~0 && 441 >= ~a12~0) && 3 == ~a1~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {26520#(<= ~a19~0 9)} assume !((10 == ~a19~0 && (((2 == calculate_output_~input#1 && 178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a13~0) && 3 == ~a1~0) && 1 == ~a26~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {26520#(<= ~a19~0 9)} assume !(((2 == ~a1~0 && (1 == ~a26~0 && 2 == calculate_output_~input#1 && (((95 < ~a23~0 && 264 >= ~a23~0) || (264 < ~a23~0 && 476 >= ~a23~0)) || 476 < ~a23~0)) && 441 < ~a12~0) && 1 == ~a13~0) && 13 == ~a19~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {26520#(<= ~a19~0 9)} assume !(((((2 == ~a1~0 && !(1 == ~a13~0) && 6 == calculate_output_~input#1) && 12 == ~a19~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 178 < ~a12~0 && 395 >= ~a12~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {26520#(<= ~a19~0 9)} assume !(1 == ~a26~0 && ((((395 < ~a12~0 && 441 >= ~a12~0) && 5 == calculate_output_~input#1 && 11 == ~a19~0) && 1 == ~a13~0) && 3 == ~a1~0) && 264 < ~a23~0 && 476 >= ~a23~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {26520#(<= ~a19~0 9)} assume !(1 == ~a13~0 && ((441 < ~a12~0 && 6 == calculate_output_~input#1 && (((476 < ~a23~0 && 9 == ~a19~0) || (~a23~0 <= 95 && 10 == ~a19~0)) || ((95 < ~a23~0 && 264 >= ~a23~0) && 10 == ~a19~0))) && 1 == ~a26~0) && 2 == ~a1~0); {26520#(<= ~a19~0 9)} is VALID [2022-02-20 15:33:56,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {26520#(<= ~a19~0 9)} assume (264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0 && (!(1 == ~a13~0) && 3 == ~a1~0 && 3 == calculate_output_~input#1 && 10 == ~a19~0) && ~a12~0 <= 178;~a12~0 := (if (if 9 * ~a12~0 < 0 && 0 != 9 * ~a12~0 % 10 then 1 + 9 * ~a12~0 / 10 else 9 * ~a12~0 / 10) < 0 && 0 != (if 9 * ~a12~0 < 0 && 0 != 9 * ~a12~0 % 10 then 1 + 9 * ~a12~0 / 10 else 9 * ~a12~0 / 10) % 108 then (if 9 * ~a12~0 < 0 && 0 != 9 * ~a12~0 % 10 then 1 + 9 * ~a12~0 / 10 else 9 * ~a12~0 / 10) % 108 - 108 else (if 9 * ~a12~0 < 0 && 0 != 9 * ~a12~0 % 10 then 1 + 9 * ~a12~0 / 10 else 9 * ~a12~0 / 10) % 108) - -286;~a23~0 := (if 50 * (if 10 * ~a23~0 < 0 && 0 != 10 * ~a23~0 % 5 then 1 + 10 * ~a23~0 / 5 else 10 * ~a23~0 / 5) < 0 && 0 != 50 * (if 10 * ~a23~0 < 0 && 0 != 10 * ~a23~0 % 5 then 1 + 10 * ~a23~0 / 5 else 10 * ~a23~0 / 5) % 9 then 1 + 50 * (if 10 * ~a23~0 < 0 && 0 != 10 * ~a23~0 % 5 then 1 + 10 * ~a23~0 / 5 else 10 * ~a23~0 / 5) / 9 else 50 * (if 10 * ~a23~0 < 0 && 0 != 10 * ~a23~0 % 5 then 1 + 10 * ~a23~0 / 5 else 10 * ~a23~0 / 5) / 9);~a19~0 := 12;~a13~0 := 1;calculate_output_#res#1 := -1; {26519#false} is VALID [2022-02-20 15:33:56,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {26519#false} main_#t~ret13#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_~output~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {26519#false} is VALID [2022-02-20 15:33:56,327 INFO L290 TraceCheckUtils]: 87: Hoare triple {26519#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {26519#false} is VALID [2022-02-20 15:33:56,327 INFO L290 TraceCheckUtils]: 88: Hoare triple {26519#false} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {26519#false} is VALID [2022-02-20 15:33:56,327 INFO L290 TraceCheckUtils]: 89: Hoare triple {26519#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {26519#false} is VALID [2022-02-20 15:33:56,327 INFO L290 TraceCheckUtils]: 90: Hoare triple {26519#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {26519#false} is VALID [2022-02-20 15:33:56,327 INFO L290 TraceCheckUtils]: 91: Hoare triple {26519#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {26519#false} is VALID [2022-02-20 15:33:56,328 INFO L290 TraceCheckUtils]: 92: Hoare triple {26519#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {26519#false} is VALID [2022-02-20 15:33:56,328 INFO L290 TraceCheckUtils]: 93: Hoare triple {26519#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {26519#false} is VALID [2022-02-20 15:33:56,328 INFO L290 TraceCheckUtils]: 94: Hoare triple {26519#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {26519#false} is VALID [2022-02-20 15:33:56,328 INFO L290 TraceCheckUtils]: 95: Hoare triple {26519#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {26519#false} is VALID [2022-02-20 15:33:56,328 INFO L290 TraceCheckUtils]: 96: Hoare triple {26519#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {26519#false} is VALID [2022-02-20 15:33:56,329 INFO L290 TraceCheckUtils]: 97: Hoare triple {26519#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {26519#false} is VALID [2022-02-20 15:33:56,329 INFO L290 TraceCheckUtils]: 98: Hoare triple {26519#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {26519#false} is VALID [2022-02-20 15:33:56,329 INFO L290 TraceCheckUtils]: 99: Hoare triple {26519#false} assume ((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0; {26519#false} is VALID [2022-02-20 15:33:56,329 INFO L290 TraceCheckUtils]: 100: Hoare triple {26519#false} assume !false; {26519#false} is VALID [2022-02-20 15:33:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:33:56,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:33:56,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582568009] [2022-02-20 15:33:56,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582568009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:33:56,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:33:56,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:33:56,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893500472] [2022-02-20 15:33:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:33:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 15:33:56,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:33:56,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:33:56,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:56,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:33:56,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:33:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:33:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:56,401 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:05,206 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2022-02-20 15:34:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:34:05,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 15:34:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:34:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5320 transitions. [2022-02-20 15:34:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5320 transitions. [2022-02-20 15:34:05,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5320 transitions. [2022-02-20 15:34:09,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5320 edges. 5320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:34:10,731 INFO L225 Difference]: With dead ends: 10352 [2022-02-20 15:34:10,731 INFO L226 Difference]: Without dead ends: 6773 [2022-02-20 15:34:10,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:34:10,735 INFO L933 BasicCegarLoop]: 1021 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 15:34:10,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 1172 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 15:34:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2022-02-20 15:34:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2022-02-20 15:34:10,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:34:10,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6773 states. Second operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:10,884 INFO L74 IsIncluded]: Start isIncluded. First operand 6773 states. Second operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:10,894 INFO L87 Difference]: Start difference. First operand 6773 states. Second operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:12,271 INFO L93 Difference]: Finished difference Result 6773 states and 8987 transitions. [2022-02-20 15:34:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 8987 transitions. [2022-02-20 15:34:12,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:34:12,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:34:12,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 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 6773 states. [2022-02-20 15:34:12,299 INFO L87 Difference]: Start difference. First operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 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 6773 states.