./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/bitvector/num_conversion_1.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc393f6c4862d8369d85fc8f5aceb831c4046350 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/bitvector/num_conversion_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc393f6c4862d8369d85fc8f5aceb831c4046350 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:33:52,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:33:52,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:33:52,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:33:52,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:33:52,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:33:52,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:33:52,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:33:52,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:33:52,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:33:52,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:33:52,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:33:52,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:33:52,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:33:52,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:33:52,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:33:52,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:33:52,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:33:52,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:33:52,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:33:52,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:33:52,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:33:52,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:33:52,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:33:52,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:33:52,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:33:52,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:33:52,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:33:52,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:33:52,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:33:52,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:33:52,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:33:52,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:33:52,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:33:52,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:33:52,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:33:52,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:33:52,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:33:52,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:33:52,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:33:52,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:33:52,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:33:52,460 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:33:52,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:33:52,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:33:52,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:33:52,462 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:33:52,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:33:52,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:33:52,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:33:52,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:33:52,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:33:52,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:33:52,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:33:52,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:33:52,465 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:33:52,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:33:52,465 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:33:52,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:33:52,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:33:52,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:33:52,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:33:52,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:33:52,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:33:52,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:33:52,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:33:52,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:33:52,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:33:52,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:33:52,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:33:52,469 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> dc393f6c4862d8369d85fc8f5aceb831c4046350 [2019-11-27 22:33:52,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:33:52,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:33:52,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:33:52,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:33:52,783 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:33:52,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2019-11-27 22:33:52,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3fafcb6/8deb6b4280d0413dafa20599089e2857/FLAGfdac52e77 [2019-11-27 22:33:53,327 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:33:53,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2019-11-27 22:33:53,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3fafcb6/8deb6b4280d0413dafa20599089e2857/FLAGfdac52e77 [2019-11-27 22:33:53,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3fafcb6/8deb6b4280d0413dafa20599089e2857 [2019-11-27 22:33:53,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:33:53,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:33:53,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:33:53,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:33:53,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:33:53,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:53,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245d122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53, skipping insertion in model container [2019-11-27 22:33:53,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:53,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:33:53,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:33:53,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:33:53,940 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:33:53,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:33:53,975 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:33:53,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53 WrapperNode [2019-11-27 22:33:53,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:33:53,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:33:53,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:33:53,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:33:53,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:33:54,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:33:54,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:33:54,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:33:54,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... [2019-11-27 22:33:54,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:33:54,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:33:54,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:33:54,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:33:54,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:33:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:33:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:33:54,314 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:33:54,314 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:33:54,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:54 BoogieIcfgContainer [2019-11-27 22:33:54,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:33:54,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:33:54,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:33:54,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:33:54,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:33:53" (1/3) ... [2019-11-27 22:33:54,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31928986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:33:54, skipping insertion in model container [2019-11-27 22:33:54,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:53" (2/3) ... [2019-11-27 22:33:54,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31928986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:33:54, skipping insertion in model container [2019-11-27 22:33:54,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:54" (3/3) ... [2019-11-27 22:33:54,322 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2019-11-27 22:33:54,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:33:54,334 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:33:54,345 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:33:54,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:33:54,366 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:33:54,366 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:33:54,366 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:33:54,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:33:54,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:33:54,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:33:54,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:33:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-11-27 22:33:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-27 22:33:54,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:54,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-27 22:33:54,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2019-11-27 22:33:54,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:54,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451913365] [2019-11-27 22:33:54,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:54,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451913365] [2019-11-27 22:33:54,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:54,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:33:54,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374858563] [2019-11-27 22:33:54,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:33:54,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:33:54,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:33:54,526 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-27 22:33:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:54,543 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-27 22:33:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:33:54,545 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-27 22:33:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:54,554 INFO L225 Difference]: With dead ends: 20 [2019-11-27 22:33:54,555 INFO L226 Difference]: Without dead ends: 8 [2019-11-27 22:33:54,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:33:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-27 22:33:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-27 22:33:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-27 22:33:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-27 22:33:54,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-11-27 22:33:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:54,596 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-27 22:33:54,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:33:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-11-27 22:33:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-27 22:33:54,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:54,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-27 22:33:54,597 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:54,598 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2019-11-27 22:33:54,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:54,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525096648] [2019-11-27 22:33:54,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:54,793 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-11-27 22:33:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:54,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525096648] [2019-11-27 22:33:54,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:54,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:33:54,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419405591] [2019-11-27 22:33:54,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:33:54,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:54,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:33:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:54,799 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2019-11-27 22:33:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:54,824 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-27 22:33:54,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:33:54,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-27 22:33:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:54,825 INFO L225 Difference]: With dead ends: 15 [2019-11-27 22:33:54,825 INFO L226 Difference]: Without dead ends: 11 [2019-11-27 22:33:54,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-11-27 22:33:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-11-27 22:33:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-27 22:33:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-27 22:33:54,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-11-27 22:33:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:54,831 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-27 22:33:54,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:33:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-11-27 22:33:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 22:33:54,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:54,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:33:54,833 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:54,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:54,834 INFO L82 PathProgramCache]: Analyzing trace with hash 608596189, now seen corresponding path program 1 times [2019-11-27 22:33:54,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:54,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796870439] [2019-11-27 22:33:54,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:54,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796870439] [2019-11-27 22:33:54,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401404591] [2019-11-27 22:33:54,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:55,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:33:55,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:33:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:55,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:33:55,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-27 22:33:55,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864954910] [2019-11-27 22:33:55,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:33:55,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:33:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:33:55,066 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-11-27 22:33:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:55,103 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-27 22:33:55,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:33:55,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-27 22:33:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:55,105 INFO L225 Difference]: With dead ends: 18 [2019-11-27 22:33:55,105 INFO L226 Difference]: Without dead ends: 14 [2019-11-27 22:33:55,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:33:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-27 22:33:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-27 22:33:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-27 22:33:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-27 22:33:55,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2019-11-27 22:33:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:55,110 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-27 22:33:55,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:33:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-11-27 22:33:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 22:33:55,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:55,111 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-11-27 22:33:55,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:55,312 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1123862993, now seen corresponding path program 2 times [2019-11-27 22:33:55,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:55,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550204689] [2019-11-27 22:33:55,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:55,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550204689] [2019-11-27 22:33:55,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257249190] [2019-11-27 22:33:55,431 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:55,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:33:55,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:33:55,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 22:33:55,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:33:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:55,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:33:55,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-27 22:33:55,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620209407] [2019-11-27 22:33:55,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:33:55,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:33:55,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:33:55,535 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-11-27 22:33:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:55,583 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-11-27 22:33:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:33:55,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-27 22:33:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:55,585 INFO L225 Difference]: With dead ends: 21 [2019-11-27 22:33:55,585 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 22:33:55,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:33:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 22:33:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-27 22:33:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-27 22:33:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-27 22:33:55,590 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2019-11-27 22:33:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:55,591 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-27 22:33:55,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:33:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-11-27 22:33:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:33:55,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:55,592 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2019-11-27 22:33:55,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:55,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash -193357923, now seen corresponding path program 3 times [2019-11-27 22:33:55,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:55,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138416266] [2019-11-27 22:33:55,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:55,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138416266] [2019-11-27 22:33:55,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637063196] [2019-11-27 22:33:55,894 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:55,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-27 22:33:55,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:33:55,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 22:33:55,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:33:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:56,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:33:56,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-27 22:33:56,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171425292] [2019-11-27 22:33:56,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 22:33:56,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 22:33:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:33:56,030 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 9 states. [2019-11-27 22:33:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:56,109 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-27 22:33:56,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:33:56,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-11-27 22:33:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:56,111 INFO L225 Difference]: With dead ends: 24 [2019-11-27 22:33:56,111 INFO L226 Difference]: Without dead ends: 20 [2019-11-27 22:33:56,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:33:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-27 22:33:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-11-27 22:33:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-27 22:33:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-11-27 22:33:56,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2019-11-27 22:33:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:56,117 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-27 22:33:56,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 22:33:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-11-27 22:33:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:33:56,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:56,118 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2019-11-27 22:33:56,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:56,319 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:56,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 764254063, now seen corresponding path program 4 times [2019-11-27 22:33:56,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:56,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881350377] [2019-11-27 22:33:56,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:56,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881350377] [2019-11-27 22:33:56,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599075803] [2019-11-27 22:33:56,467 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:56,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 22:33:56,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:33:56,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 22:33:56,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:33:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:56,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:33:56,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 22:33:56,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253533490] [2019-11-27 22:33:56,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 22:33:56,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 22:33:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-27 22:33:56,623 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 11 states. [2019-11-27 22:33:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:56,717 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-11-27 22:33:56,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:33:56,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-11-27 22:33:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:56,718 INFO L225 Difference]: With dead ends: 27 [2019-11-27 22:33:56,718 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 22:33:56,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-27 22:33:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 22:33:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-27 22:33:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 22:33:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-27 22:33:56,725 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2019-11-27 22:33:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:56,725 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-27 22:33:56,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 22:33:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-11-27 22:33:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:33:56,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:56,727 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1] [2019-11-27 22:33:56,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:56,929 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:56,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1810148957, now seen corresponding path program 5 times [2019-11-27 22:33:56,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:56,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601096584] [2019-11-27 22:33:56,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:57,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601096584] [2019-11-27 22:33:57,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018721980] [2019-11-27 22:33:57,098 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:57,140 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-27 22:33:57,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:33:57,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-27 22:33:57,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:33:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:57,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:33:57,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-27 22:33:57,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541139870] [2019-11-27 22:33:57,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 22:33:57,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:57,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 22:33:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:33:57,318 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 13 states. [2019-11-27 22:33:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:57,440 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-11-27 22:33:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:33:57,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-27 22:33:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:57,443 INFO L225 Difference]: With dead ends: 30 [2019-11-27 22:33:57,443 INFO L226 Difference]: Without dead ends: 26 [2019-11-27 22:33:57,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:33:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-27 22:33:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-27 22:33:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-27 22:33:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-27 22:33:57,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 20 [2019-11-27 22:33:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:57,452 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-27 22:33:57,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 22:33:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-27 22:33:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:33:57,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:57,453 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2019-11-27 22:33:57,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:57,664 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:57,666 INFO L82 PathProgramCache]: Analyzing trace with hash 77203631, now seen corresponding path program 6 times [2019-11-27 22:33:57,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:57,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191294583] [2019-11-27 22:33:57,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:57,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191294583] [2019-11-27 22:33:57,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081081584] [2019-11-27 22:33:57,795 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:57,841 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-27 22:33:57,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:33:57,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-27 22:33:57,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:33:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:58,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:33:58,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-27 22:33:58,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178778817] [2019-11-27 22:33:58,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 22:33:58,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:58,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 22:33:58,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-27 22:33:58,101 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 15 states. [2019-11-27 22:33:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:58,254 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-11-27 22:33:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:33:58,255 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-11-27 22:33:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:58,255 INFO L225 Difference]: With dead ends: 33 [2019-11-27 22:33:58,256 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 22:33:58,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-27 22:33:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 22:33:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-27 22:33:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 22:33:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-27 22:33:58,263 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 23 [2019-11-27 22:33:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:58,263 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-27 22:33:58,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 22:33:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-11-27 22:33:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:33:58,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:58,265 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1] [2019-11-27 22:33:58,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:58,469 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:58,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash -590105315, now seen corresponding path program 7 times [2019-11-27 22:33:58,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:58,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531181892] [2019-11-27 22:33:58,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:58,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531181892] [2019-11-27 22:33:58,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980423545] [2019-11-27 22:33:58,588 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:58,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 22:33:58,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:33:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:58,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:33:58,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-27 22:33:58,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231463076] [2019-11-27 22:33:58,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 22:33:58,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 22:33:58,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-27 22:33:58,892 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 17 states. [2019-11-27 22:33:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:59,152 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-11-27 22:33:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 22:33:59,153 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-11-27 22:33:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:59,154 INFO L225 Difference]: With dead ends: 36 [2019-11-27 22:33:59,154 INFO L226 Difference]: Without dead ends: 32 [2019-11-27 22:33:59,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-27 22:33:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-27 22:33:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-27 22:33:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 22:33:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-11-27 22:33:59,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 26 [2019-11-27 22:33:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:59,161 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-27 22:33:59,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 22:33:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-11-27 22:33:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:33:59,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:59,162 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2019-11-27 22:33:59,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:33:59,366 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:59,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1012697583, now seen corresponding path program 8 times [2019-11-27 22:33:59,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:59,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424501011] [2019-11-27 22:33:59,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:33:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:33:59,437 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:33:59,437 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:33:59,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:33:59 BoogieIcfgContainer [2019-11-27 22:33:59,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:33:59,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:33:59,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:33:59,474 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:33:59,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:54" (3/4) ... [2019-11-27 22:33:59,479 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 22:33:59,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:33:59,481 INFO L168 Benchmark]: Toolchain (without parser) took 5757.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:59,487 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:33:59,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.73 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:59,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:59,490 INFO L168 Benchmark]: Boogie Preprocessor took 20.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:33:59,491 INFO L168 Benchmark]: RCFGBuilder took 223.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:59,497 INFO L168 Benchmark]: TraceAbstraction took 5157.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:59,498 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:33:59,506 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.73 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 223.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5157.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 22, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND FALSE !(c < (unsigned char)8) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.0s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 125 SDtfs, 136 SDslu, 565 SDs, 0 SdLazy, 585 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 81 SyntacticMatches, 13 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 232 ConstructedInterpolants, 70 QuantifiedInterpolants, 54320 SizeOfPredicates, 7 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/392 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:34:01,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:01,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:01,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:01,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:01,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:01,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:01,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:01,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:01,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:01,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:01,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:01,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:01,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:01,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:01,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:01,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:01,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:01,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:01,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:01,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:01,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:01,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:01,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:01,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:01,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:01,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:01,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:01,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:01,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:01,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:01,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:01,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:01,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:01,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:01,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:01,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:01,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:01,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:01,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:01,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:01,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 22:34:01,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:01,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:01,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:01,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:01,505 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:01,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:01,506 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:01,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:01,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:01,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:01,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:01,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:01,507 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 22:34:01,508 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 22:34:01,508 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:01,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:01,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:01,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:01,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:01,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:01,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:01,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:01,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:01,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:01,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:01,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:01,511 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 22:34:01,511 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 22:34:01,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:01,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 22:34:01,512 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> dc393f6c4862d8369d85fc8f5aceb831c4046350 [2019-11-27 22:34:01,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:01,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:01,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:01,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:01,898 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:01,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2019-11-27 22:34:01,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f800c839/5e56d3e6f7154135b5411f929cd50dc9/FLAG5faa0fc3f [2019-11-27 22:34:02,384 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:02,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2019-11-27 22:34:02,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f800c839/5e56d3e6f7154135b5411f929cd50dc9/FLAG5faa0fc3f [2019-11-27 22:34:02,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f800c839/5e56d3e6f7154135b5411f929cd50dc9 [2019-11-27 22:34:02,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:02,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:02,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:02,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:02,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:02,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:02" (1/1) ... [2019-11-27 22:34:02,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245d122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:02, skipping insertion in model container [2019-11-27 22:34:02,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:02" (1/1) ... [2019-11-27 22:34:02,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:02,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:03,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:03,056 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:03,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:03,087 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:03,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03 WrapperNode [2019-11-27 22:34:03,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:03,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:03,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:03,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:03,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:03,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:03,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:03,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:03,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:03,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:03,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:03,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:03,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:03,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:03,418 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:03,419 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:34:03,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:03 BoogieIcfgContainer [2019-11-27 22:34:03,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:03,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:03,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:03,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:03,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:02" (1/3) ... [2019-11-27 22:34:03,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a8fcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:03, skipping insertion in model container [2019-11-27 22:34:03,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (2/3) ... [2019-11-27 22:34:03,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a8fcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:03, skipping insertion in model container [2019-11-27 22:34:03,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:03" (3/3) ... [2019-11-27 22:34:03,429 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2019-11-27 22:34:03,436 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:03,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:34:03,456 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:34:03,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:03,477 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:03,477 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:03,477 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:03,477 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:03,477 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:03,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:03,478 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-11-27 22:34:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-27 22:34:03,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:03,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-27 22:34:03,497 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2019-11-27 22:34:03,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:03,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150120099] [2019-11-27 22:34:03,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:03,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 22:34:03,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:03,578 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:03,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150120099] [2019-11-27 22:34:03,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:03,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 22:34:03,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46511292] [2019-11-27 22:34:03,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:34:03,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:34:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:34:03,613 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-27 22:34:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:03,636 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-27 22:34:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:34:03,637 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-27 22:34:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:03,647 INFO L225 Difference]: With dead ends: 20 [2019-11-27 22:34:03,647 INFO L226 Difference]: Without dead ends: 8 [2019-11-27 22:34:03,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:34:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-27 22:34:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-27 22:34:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-27 22:34:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-27 22:34:03,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-11-27 22:34:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:03,684 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-27 22:34:03,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:34:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-11-27 22:34:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-27 22:34:03,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:03,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-27 22:34:03,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 22:34:03,895 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:03,896 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2019-11-27 22:34:03,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:03,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014439219] [2019-11-27 22:34:03,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:03,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:03,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:03,948 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:03,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014439219] [2019-11-27 22:34:03,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:03,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-27 22:34:03,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530008946] [2019-11-27 22:34:03,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:03,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:03,961 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-11-27 22:34:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:04,001 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-27 22:34:04,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:04,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-27 22:34:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:04,002 INFO L225 Difference]: With dead ends: 16 [2019-11-27 22:34:04,002 INFO L226 Difference]: Without dead ends: 12 [2019-11-27 22:34:04,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-27 22:34:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-27 22:34:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-27 22:34:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-27 22:34:04,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2019-11-27 22:34:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:04,008 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-27 22:34:04,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-11-27 22:34:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 22:34:04,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:04,009 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-11-27 22:34:04,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 22:34:04,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:04,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:04,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1123862993, now seen corresponding path program 1 times [2019-11-27 22:34:04,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:04,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116946272] [2019-11-27 22:34:04,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:04,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:34:04,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:04,319 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:04,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116946272] [2019-11-27 22:34:04,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:04,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-27 22:34:04,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572041070] [2019-11-27 22:34:04,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:34:04,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:34:04,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:34:04,398 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-11-27 22:34:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:04,636 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-11-27 22:34:04,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 22:34:04,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-27 22:34:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:04,638 INFO L225 Difference]: With dead ends: 41 [2019-11-27 22:34:04,638 INFO L226 Difference]: Without dead ends: 34 [2019-11-27 22:34:04,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:34:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-27 22:34:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2019-11-27 22:34:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-27 22:34:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-27 22:34:04,653 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 11 [2019-11-27 22:34:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:04,654 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-27 22:34:04,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:34:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-11-27 22:34:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 22:34:04,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:04,655 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:04,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 22:34:04,866 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:04,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1066604691, now seen corresponding path program 1 times [2019-11-27 22:34:04,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:04,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128774831] [2019-11-27 22:34:04,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:04,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:34:04,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:04,908 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:04,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128774831] [2019-11-27 22:34:04,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:04,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-27 22:34:04,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058681004] [2019-11-27 22:34:04,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:34:04,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:04,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:34:04,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:04,951 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 8 states. [2019-11-27 22:34:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:05,068 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-27 22:34:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:34:05,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-11-27 22:34:05,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:05,070 INFO L225 Difference]: With dead ends: 28 [2019-11-27 22:34:05,070 INFO L226 Difference]: Without dead ends: 24 [2019-11-27 22:34:05,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:34:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-27 22:34:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-27 22:34:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-27 22:34:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-27 22:34:05,083 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2019-11-27 22:34:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:05,083 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-27 22:34:05,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:34:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-27 22:34:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:34:05,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:05,085 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1] [2019-11-27 22:34:05,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 22:34:05,296 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1658775637, now seen corresponding path program 2 times [2019-11-27 22:34:05,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:05,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598231274] [2019-11-27 22:34:05,298 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:05,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:34:05,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:34:05,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 22:34:05,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:34:05,430 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:34:05,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598231274] [2019-11-27 22:34:05,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:05,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-27 22:34:05,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237499844] [2019-11-27 22:34:05,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 22:34:05,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:05,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 22:34:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:34:05,614 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 13 states. [2019-11-27 22:34:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:06,227 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-27 22:34:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 22:34:06,228 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-27 22:34:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:06,229 INFO L225 Difference]: With dead ends: 75 [2019-11-27 22:34:06,229 INFO L226 Difference]: Without dead ends: 66 [2019-11-27 22:34:06,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-11-27 22:34:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-27 22:34:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2019-11-27 22:34:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-27 22:34:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-11-27 22:34:06,241 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 23 [2019-11-27 22:34:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:06,241 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-11-27 22:34:06,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 22:34:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-11-27 22:34:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:34:06,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:06,248 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1] [2019-11-27 22:34:06,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 22:34:06,449 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash -978717267, now seen corresponding path program 3 times [2019-11-27 22:34:06,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:06,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068273338] [2019-11-27 22:34:06,453 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:06,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 22:34:06,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:34:06,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 22:34:06,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:06,566 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:06,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068273338] [2019-11-27 22:34:06,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:06,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-27 22:34:06,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100590043] [2019-11-27 22:34:06,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:34:06,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:06,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:34:06,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:34:06,673 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 10 states. [2019-11-27 22:34:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:06,949 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2019-11-27 22:34:06,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:34:06,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-27 22:34:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:06,954 INFO L225 Difference]: With dead ends: 86 [2019-11-27 22:34:06,954 INFO L226 Difference]: Without dead ends: 52 [2019-11-27 22:34:06,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-11-27 22:34:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-27 22:34:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-11-27 22:34:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 22:34:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-11-27 22:34:06,967 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 23 [2019-11-27 22:34:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:06,968 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-11-27 22:34:06,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:34:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-11-27 22:34:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:34:06,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:06,969 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1] [2019-11-27 22:34:07,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 22:34:07,189 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash -921458965, now seen corresponding path program 4 times [2019-11-27 22:34:07,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:07,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595888479] [2019-11-27 22:34:07,192 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:07,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 22:34:07,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:34:07,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 22:34:07,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:07,298 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:07,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595888479] [2019-11-27 22:34:07,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:07,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-27 22:34:07,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994469094] [2019-11-27 22:34:07,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 22:34:07,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:07,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 22:34:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-27 22:34:07,487 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 16 states. [2019-11-27 22:34:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:07,807 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-11-27 22:34:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 22:34:07,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-27 22:34:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:07,811 INFO L225 Difference]: With dead ends: 80 [2019-11-27 22:34:07,811 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 22:34:07,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-11-27 22:34:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 22:34:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-27 22:34:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:34:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-27 22:34:07,831 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 23 [2019-11-27 22:34:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:07,831 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-27 22:34:07,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 22:34:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-27 22:34:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:34:07,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:07,833 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1] [2019-11-27 22:34:08,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 22:34:08,047 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1658007635, now seen corresponding path program 5 times [2019-11-27 22:34:08,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:08,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884897463] [2019-11-27 22:34:08,050 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:08,079 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-27 22:34:08,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:34:08,081 WARN L253 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-27 22:34:08,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:09,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:34:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:09,374 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 7 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:11,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884897463] [2019-11-27 22:34:11,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:11,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2019-11-27 22:34:11,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178470562] [2019-11-27 22:34:11,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-27 22:34:11,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-27 22:34:11,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1391, Unknown=0, NotChecked=0, Total=1640 [2019-11-27 22:34:11,701 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 41 states. [2019-11-27 22:34:12,858 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 58 [2019-11-27 22:34:15,160 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 91 [2019-11-27 22:34:15,517 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 95 [2019-11-27 22:34:15,911 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 85 [2019-11-27 22:34:16,215 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 89 [2019-11-27 22:34:16,688 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 105 [2019-11-27 22:34:17,008 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-27 22:34:17,388 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-11-27 22:34:17,688 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-27 22:34:17,987 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-11-27 22:34:18,345 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-11-27 22:34:18,607 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-27 22:34:18,838 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-27 22:34:19,099 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-11-27 22:34:19,399 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-11-27 22:34:19,624 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-27 22:34:19,975 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-11-27 22:34:20,248 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-11-27 22:34:21,335 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-27 22:34:22,701 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-11-27 22:34:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,714 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-27 22:34:22,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-27 22:34:22,715 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 29 [2019-11-27 22:34:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,716 INFO L225 Difference]: With dead ends: 91 [2019-11-27 22:34:22,716 INFO L226 Difference]: Without dead ends: 83 [2019-11-27 22:34:22,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=1078, Invalid=6232, Unknown=0, NotChecked=0, Total=7310 [2019-11-27 22:34:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-27 22:34:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2019-11-27 22:34:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-27 22:34:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-11-27 22:34:22,738 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 29 [2019-11-27 22:34:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,739 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-11-27 22:34:22,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-27 22:34:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-11-27 22:34:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-27 22:34:22,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,741 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 12, 7, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 22:34:22,948 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,950 INFO L82 PathProgramCache]: Analyzing trace with hash 53203109, now seen corresponding path program 6 times [2019-11-27 22:34:22,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:22,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411340039] [2019-11-27 22:34:22,951 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:22,980 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-27 22:34:22,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:34:22,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 22:34:22,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 318 proven. 8 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-27 22:34:23,178 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 282 proven. 44 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-27 22:34:23,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411340039] [2019-11-27 22:34:23,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:23,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-27 22:34:23,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184702534] [2019-11-27 22:34:23,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 22:34:23,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:23,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 22:34:23,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-11-27 22:34:23,548 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 18 states. [2019-11-27 22:34:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,258 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-11-27 22:34:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 22:34:24,259 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2019-11-27 22:34:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,260 INFO L225 Difference]: With dead ends: 72 [2019-11-27 22:34:24,260 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:34:24,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-11-27 22:34:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:34:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:34:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:34:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:34:24,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2019-11-27 22:34:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,262 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:34:24,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 22:34:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:34:24,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:34:24,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 22:34:24,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:34:24,626 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 270 [2019-11-27 22:34:25,744 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 267 DAG size of output: 192 [2019-11-27 22:34:25,748 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:34:25,748 INFO L249 CegarLoopResult]: At program point L31(lines 12 32) the Hoare annotation is: true [2019-11-27 22:34:25,749 INFO L242 CegarLoopResult]: At program point L21-2(lines 21 28) the Hoare annotation is: (let ((.cse48 ((_ zero_extend 24) ULTIMATE.start_main_~c~0))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse48 (_ bv1 32))))) (.cse47 (= (_ bv0 32) ((_ zero_extend 24) ULTIMATE.start_main_~bit~0)))) (let ((.cse9 (= ULTIMATE.start_main_~bit~0 (_ bv0 8))) (.cse16 ((_ zero_extend 24) ULTIMATE.start_main_~x~0)) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse8 (or (bvslt .cse17 (_ bv8 32)) .cse47)) (.cse7 (= (_ bv37 8) ULTIMATE.start_main_~x~0)) (.cse20 (not .cse47))) (or (and (exists ((v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 (_ bv1 32)))))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv1 32)))))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse1 (_ bv1 32)))))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse3))))) (and (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ULTIMATE.start_main_~x~0) .cse0))) (_ bv0 32))) (bvslt .cse1 (_ bv8 32)) (bvslt .cse2 (_ bv8 32)) (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 (_ bv1 32)))) (_ bv1 32)))) (bvslt .cse4 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse2))))) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse4)))))) .cse0)) ULTIMATE.start_main_~y~0) (bvslt .cse5 (_ bv8 32)) (bvslt .cse6 (_ bv8 32))))))))))) .cse7 .cse8) (and .cse9 (exists ((v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 (_ bv1 32)))))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse13 (_ bv1 32)))))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 (_ bv1 32)))))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd .cse10 (_ bv1 32))) ULTIMATE.start_main_~c~0) (bvslt .cse10 (_ bv8 32)) (bvslt .cse11 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse11))))) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse12))))) ULTIMATE.start_main_~y~0) (bvslt .cse12 (_ bv8 32)) (bvslt .cse13 (_ bv8 32)) (bvslt .cse14 (_ bv8 32))))))))) .cse7 (= (_ bv5 8) ULTIMATE.start_main_~c~0)) (and (= (_ bv0 8) ULTIMATE.start_main_~y~0) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv37 32) .cse15))) (_ bv0 32))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 (_ bv1 32)))))))))) (_ bv0 32))) .cse7) (and (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse17)))))))) (exists ((v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45))) (and (bvslt .cse18 (_ bv8 32)) (= ULTIMATE.start_main_~y~0 ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse18))))) (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse18 (_ bv1 32))))))) .cse7 (exists ((v_ULTIMATE.start_main_~c~0_27 (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_27))) (and (= ((_ extract 7 0) (bvadd .cse19 (_ bv1 32))) ULTIMATE.start_main_~c~0) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv37 32) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse19))))))))))) .cse20) (and .cse7 (exists ((v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 (_ bv1 32)))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 (_ bv1 32)))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 (_ bv1 32)))))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 (_ bv1 32)))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24))))) (and (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ULTIMATE.start_main_~x~0) .cse21))) (_ bv0 32))) (bvslt .cse22 (_ bv8 32)) (bvslt .cse23 (_ bv8 32)) (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse24 (_ bv1 32)))) (bvslt .cse25 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse23))))) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse25)))))) .cse21)) ULTIMATE.start_main_~y~0) (bvslt .cse26 (_ bv8 32)) (bvslt .cse27 (_ bv8 32))))))))))) (= (_ bv0 8) (bvadd ULTIMATE.start_main_~bit~0 (_ bv224 8)))) (and .cse9 .cse7 (exists ((v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 (_ bv1 32)))))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 (_ bv1 32)))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 (_ bv1 32)))))) (and (bvslt .cse28 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28))))) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse29))))) ULTIMATE.start_main_~y~0) (= ((_ extract 7 0) (bvadd .cse30 (_ bv1 32))) ULTIMATE.start_main_~c~0) (bvslt .cse29 (_ bv8 32)) (bvslt .cse31 (_ bv8 32)) (bvslt .cse30 (_ bv8 32)))))))) (= (_ bv4 8) ULTIMATE.start_main_~c~0)) (and .cse9 .cse7 (= (_ bv2 8) ULTIMATE.start_main_~c~0) (exists ((v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 (_ bv1 32)))))) (and (bvslt .cse32 (_ bv8 32)) (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse33 (_ bv1 32)))) (= ULTIMATE.start_main_~y~0 ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse32))))) (bvslt .cse33 (_ bv8 32))))))) (and (exists ((v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8))) (let ((.cse36 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45))) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 (_ bv1 32)))))) (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse39 (_ bv1 32)))))) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse38 (_ bv1 32)))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse40 (_ bv1 32)))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 (_ bv1 32)))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse37))))) (and (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ULTIMATE.start_main_~x~0) .cse34))) (_ bv0 32))) (bvslt .cse35 (_ bv8 32)) (bvslt .cse36 (_ bv8 32)) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse37 (_ bv1 32)))) (_ bv1 32)))) (_ bv8 32)) (bvslt .cse38 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse36))))) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse38)))))) .cse34)) ULTIMATE.start_main_~y~0) (bvslt .cse39 (_ bv8 32)) (bvslt .cse40 (_ bv8 32))))))))))) .cse7 (exists ((v_ULTIMATE.start_main_~c~0_60 (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_60))) (let ((.cse42 ((_ zero_extend 24) ULTIMATE.start_main_~x~0)) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse41 (_ bv1 32)))))) (and (bvslt .cse41 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse43)))))) (_ bv0 32)) (bvslt .cse43 (_ bv8 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse41))))))) (= ((_ extract 7 0) (bvadd .cse43 (_ bv1 32))) ULTIMATE.start_main_~c~0))))) (= ((_ extract 7 0) (bvand .cse16 .cse15)) (_ bv0 8)) .cse8) (and .cse7 (= (_ bv3 8) ULTIMATE.start_main_~c~0) (exists ((v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8))) (let ((.cse44 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45))) (let ((.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse44 (_ bv1 32)))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 (_ bv1 32)))))) (and (bvslt .cse44 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse44))))) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse45))))) ULTIMATE.start_main_~y~0) (bvslt .cse45 (_ bv8 32)) (bvslt .cse46 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse45 (_ bv1 32))) ULTIMATE.start_main_~c~0)))))) .cse20))))) [2019-11-27 22:34:25,749 INFO L246 CegarLoopResult]: For program point L21-3(lines 21 28) no Hoare annotation was computed. [2019-11-27 22:34:25,750 INFO L246 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-11-27 22:34:25,750 INFO L249 CegarLoopResult]: At program point L5-2(lines 4 9) the Hoare annotation is: true [2019-11-27 22:34:25,750 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:34:25,750 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:34:25,750 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-27 22:34:25,750 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-27 22:34:25,750 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2019-11-27 22:34:25,750 INFO L246 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-27 22:34:25,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-27 22:34:25,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-27 22:34:25,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-27 22:34:25,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-27 22:34:25,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:25 BoogieIcfgContainer [2019-11-27 22:34:25,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:25,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:25,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:25,844 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:25,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:03" (3/4) ... [2019-11-27 22:34:25,848 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:34:25,858 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:34:25,859 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:34:25,887 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((((((!(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && 37bv8 == x) && (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || 0bv32 == ~zero_extendFrom8To32(bit))) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: (((((~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && 37bv8 == x) && 5bv8 == c)) || (((0bv8 == y && !(~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]) == 0bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32)) && 37bv8 == x)) || ((((!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0])) && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: (~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32) && y == ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]) && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0])) && 37bv8 == x) && (\exists v_ULTIMATE.start_main_~c~0_27 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_27), 1bv32)[7:0] == c && !(0bv32 == ~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_27))[7:0]))[7:0])))) && !(0bv32 == ~zero_extendFrom8To32(bit)))) || ((37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((((((!(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && 0bv8 == ~bvadd64(bit, 224bv8))) || (((bit == 0bv8 && 37bv8 == x) && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((((~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && 4bv8 == c)) || (((bit == 0bv8 && 37bv8 == x) && 2bv8 == c) && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]) && y == ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)))) || (((((\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((((((!(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && 37bv8 == x) && (\exists v_ULTIMATE.start_main_~c~0_60 : bv8 :: (((~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60), 8bv32) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60), 1bv32)[7:0]), 8bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60))[7:0]))[7:0])) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60), 1bv32)[7:0]), 1bv32)[7:0] == c)) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0] == 0bv8) && (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || 0bv32 == ~zero_extendFrom8To32(bit)))) || (((37bv8 == x && 3bv8 == c) && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: (((~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c)) && !(0bv32 == ~zero_extendFrom8To32(bit))) [2019-11-27 22:34:25,901 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:25,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:25,903 INFO L168 Benchmark]: Toolchain (without parser) took 23099.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 140.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:25,903 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:25,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:25,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:25,905 INFO L168 Benchmark]: Boogie Preprocessor took 21.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:25,906 INFO L168 Benchmark]: RCFGBuilder took 213.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:25,907 INFO L168 Benchmark]: TraceAbstraction took 22421.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.8 MB). Peak memory consumption was 154.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:25,907 INFO L168 Benchmark]: Witness Printer took 57.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:25,910 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 213.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22421.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.8 MB). Peak memory consumption was 154.6 MB. Max. memory is 11.5 GB. * Witness Printer took 57.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant [2019-11-27 22:34:25,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-27 22:34:25,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-27 22:34:25,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-27 22:34:25,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-27 22:34:25,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-27 22:34:25,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-27 22:34:25,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] Derived loop invariant: ((((((((((\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((((((!(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && 37bv8 == x) && (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || 0bv32 == ~zero_extendFrom8To32(bit))) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: (((((~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && 37bv8 == x) && 5bv8 == c)) || (((0bv8 == y && !(~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]) == 0bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32)) && 37bv8 == x)) || ((((!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0])) && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: (~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32) && y == ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]) && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0])) && 37bv8 == x) && (\exists v_ULTIMATE.start_main_~c~0_27 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_27), 1bv32)[7:0] == c && !(0bv32 == ~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_27))[7:0]))[7:0])))) && !(0bv32 == ~zero_extendFrom8To32(bit)))) || ((37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((((((!(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && 0bv8 == ~bvadd64(bit, 224bv8))) || (((bit == 0bv8 && 37bv8 == x) && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((((~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && 4bv8 == c)) || (((bit == 0bv8 && 37bv8 == x) && 2bv8 == c) && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]) && y == ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)))) || (((((\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: ((((((!(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && 37bv8 == x) && (\exists v_ULTIMATE.start_main_~c~0_60 : bv8 :: (((~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60), 8bv32) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60), 1bv32)[7:0]), 8bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60))[7:0]))[7:0])) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_60), 1bv32)[7:0]), 1bv32)[7:0] == c)) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0] == 0bv8) && (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || 0bv32 == ~zero_extendFrom8To32(bit)))) || (((37bv8 == x && 3bv8 == c) && (\exists v_ULTIMATE.start_main_~c~0_45 : bv8 :: (((~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45))[7:0])[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_45), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c)) && !(0bv32 == ~zero_extendFrom8To32(bit))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Result: SAFE, OverallTime: 20.9s, OverallIterations: 9, TraceHistogramMax: 19, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 64 SDtfs, 482 SDslu, 200 SDs, 0 SdLazy, 1055 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 262 SyntacticMatches, 3 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 1110 HoareAnnotationTreeSize, 3 FomulaSimplifications, 343 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1007 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 366 ConstructedInterpolants, 65 QuantifiedInterpolants, 291168 SizeOfPredicates, 38 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 1167/1574 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...