./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 f470102c 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.25-f470102 [2019-11-28 15:38:22,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:22,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:22,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:22,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:22,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:22,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:22,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:22,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:22,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:22,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:22,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:22,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:22,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:22,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:22,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:22,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:22,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:22,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:22,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:22,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:22,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:22,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:22,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:22,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:22,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:22,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:22,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:22,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:22,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:22,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:22,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:22,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:22,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:22,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:22,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:22,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:22,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:22,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:22,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:22,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:22,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:38:22,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:22,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:22,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:22,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:22,243 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:22,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:22,244 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:22,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:38:22,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:22,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:22,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:22,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:22,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:22,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:22,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:22,246 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:22,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:22,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:22,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:22,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:22,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:22,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:22,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:22,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:22,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:22,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:38:22,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:38:22,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:22,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:22,250 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-28 15:38:22,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:22,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:22,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:22,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:22,584 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:22,585 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-28 15:38:22,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef7e0682/d4d4704fd60746e9a847daa6e19b68c3/FLAG2eca135a2 [2019-11-28 15:38:23,052 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:23,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2019-11-28 15:38:23,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef7e0682/d4d4704fd60746e9a847daa6e19b68c3/FLAG2eca135a2 [2019-11-28 15:38:23,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef7e0682/d4d4704fd60746e9a847daa6e19b68c3 [2019-11-28 15:38:23,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:23,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:23,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:23,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:23,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:23,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772fdc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23, skipping insertion in model container [2019-11-28 15:38:23,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:23,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:23,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:23,736 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:23,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:23,766 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:23,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23 WrapperNode [2019-11-28 15:38:23,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:23,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:23,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:23,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:23,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:23,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:23,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:23,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:23,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (1/1) ... [2019-11-28 15:38:23,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:23,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:23,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:23,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:23,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (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-28 15:38:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:23,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:24,091 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:24,091 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:38:24,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:24 BoogieIcfgContainer [2019-11-28 15:38:24,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:24,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:24,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:24,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:24,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:23" (1/3) ... [2019-11-28 15:38:24,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a4fd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:24, skipping insertion in model container [2019-11-28 15:38:24,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:23" (2/3) ... [2019-11-28 15:38:24,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a4fd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:24, skipping insertion in model container [2019-11-28 15:38:24,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:24" (3/3) ... [2019-11-28 15:38:24,100 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2019-11-28 15:38:24,108 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:24,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:38:24,123 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:38:24,147 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:24,148 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:24,148 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:24,148 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:24,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:24,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:24,149 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:24,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-11-28 15:38:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 15:38:24,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:24,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 15:38:24,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2019-11-28 15:38:24,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:24,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102403505] [2019-11-28 15:38:24,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:24,273 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-28 15:38:24,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102403505] [2019-11-28 15:38:24,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:24,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:24,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246154657] [2019-11-28 15:38:24,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 15:38:24,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 15:38:24,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:38:24,300 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-28 15:38:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:24,316 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-28 15:38:24,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 15:38:24,317 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-28 15:38:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:24,324 INFO L225 Difference]: With dead ends: 20 [2019-11-28 15:38:24,324 INFO L226 Difference]: Without dead ends: 8 [2019-11-28 15:38:24,327 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-28 15:38:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-28 15:38:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-28 15:38:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 15:38:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 15:38:24,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-11-28 15:38:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:24,359 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 15:38:24,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 15:38:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-11-28 15:38:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 15:38:24,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:24,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 15:38:24,360 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:24,361 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2019-11-28 15:38:24,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:24,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247424578] [2019-11-28 15:38:24,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:24,453 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-28 15:38:24,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247424578] [2019-11-28 15:38:24,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:24,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:24,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135204215] [2019-11-28 15:38:24,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:24,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:24,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:24,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:24,457 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2019-11-28 15:38:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:24,503 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-28 15:38:24,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:24,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 15:38:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:24,506 INFO L225 Difference]: With dead ends: 15 [2019-11-28 15:38:24,506 INFO L226 Difference]: Without dead ends: 11 [2019-11-28 15:38:24,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-11-28 15:38:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-11-28 15:38:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 15:38:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 15:38:24,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-11-28 15:38:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:24,527 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 15:38:24,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-11-28 15:38:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 15:38:24,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:24,529 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:24,529 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:24,530 INFO L82 PathProgramCache]: Analyzing trace with hash 608596189, now seen corresponding path program 1 times [2019-11-28 15:38:24,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:24,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796999426] [2019-11-28 15:38:24,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:24,650 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-28 15:38:24,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796999426] [2019-11-28 15:38:24,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019503335] [2019-11-28 15:38:24,651 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-28 15:38:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:24,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 15:38:24,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:24,768 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-28 15:38:24,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:24,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-28 15:38:24,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93396893] [2019-11-28 15:38:24,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:38:24,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:38:24,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:38:24,771 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-11-28 15:38:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:24,822 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-28 15:38:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:38:24,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-28 15:38:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:24,825 INFO L225 Difference]: With dead ends: 18 [2019-11-28 15:38:24,825 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 15:38:24,827 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-28 15:38:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 15:38:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-28 15:38:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 15:38:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-28 15:38:24,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2019-11-28 15:38:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:24,832 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-28 15:38:24,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:38:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-11-28 15:38:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 15:38:24,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:24,833 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 15:38:25,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:25,035 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1123862993, now seen corresponding path program 2 times [2019-11-28 15:38:25,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:25,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249500749] [2019-11-28 15:38:25,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:25,154 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-28 15:38:25,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249500749] [2019-11-28 15:38:25,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612439014] [2019-11-28 15:38:25,156 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-28 15:38:25,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:38:25,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:25,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 15:38:25,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:25,252 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-28 15:38:25,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:25,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 15:38:25,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537435364] [2019-11-28 15:38:25,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:38:25,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:38:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:38:25,255 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-11-28 15:38:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:25,334 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-11-28 15:38:25,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:38:25,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 15:38:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:25,336 INFO L225 Difference]: With dead ends: 21 [2019-11-28 15:38:25,336 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 15:38:25,337 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-28 15:38:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 15:38:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-28 15:38:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 15:38:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-28 15:38:25,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2019-11-28 15:38:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:25,351 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 15:38:25,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:38:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-11-28 15:38:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:38:25,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:25,353 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2019-11-28 15:38:25,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:25,554 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:25,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:25,555 INFO L82 PathProgramCache]: Analyzing trace with hash -193357923, now seen corresponding path program 3 times [2019-11-28 15:38:25,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:25,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681380096] [2019-11-28 15:38:25,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:25,721 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-28 15:38:25,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681380096] [2019-11-28 15:38:25,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029733708] [2019-11-28 15:38:25,724 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-28 15:38:25,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 15:38:25,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:25,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 15:38:25,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:25,887 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-28 15:38:25,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:25,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-28 15:38:25,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365014805] [2019-11-28 15:38:25,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 15:38:25,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:25,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 15:38:25,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 15:38:25,890 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 9 states. [2019-11-28 15:38:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:25,983 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-28 15:38:25,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:38:25,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-11-28 15:38:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:25,987 INFO L225 Difference]: With dead ends: 24 [2019-11-28 15:38:25,987 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 15:38:25,987 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-28 15:38:25,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 15:38:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-11-28 15:38:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 15:38:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-11-28 15:38:25,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2019-11-28 15:38:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:25,997 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-28 15:38:25,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 15:38:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-11-28 15:38:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:38:25,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:25,998 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2019-11-28 15:38:26,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:26,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:26,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 764254063, now seen corresponding path program 4 times [2019-11-28 15:38:26,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:26,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484370268] [2019-11-28 15:38:26,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:26,335 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-28 15:38:26,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484370268] [2019-11-28 15:38:26,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246648178] [2019-11-28 15:38:26,336 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-28 15:38:26,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 15:38:26,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:26,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 15:38:26,379 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:26,524 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-28 15:38:26,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:26,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 15:38:26,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720335083] [2019-11-28 15:38:26,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 15:38:26,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 15:38:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 15:38:26,528 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 11 states. [2019-11-28 15:38:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:26,635 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-11-28 15:38:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:38:26,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-11-28 15:38:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:26,636 INFO L225 Difference]: With dead ends: 27 [2019-11-28 15:38:26,637 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 15:38:26,637 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-28 15:38:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 15:38:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-28 15:38:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 15:38:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-28 15:38:26,643 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2019-11-28 15:38:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:26,643 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-28 15:38:26,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 15:38:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-11-28 15:38:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:38:26,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:26,644 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1] [2019-11-28 15:38:26,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:26,849 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:26,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:26,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1810148957, now seen corresponding path program 5 times [2019-11-28 15:38:26,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:26,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398156276] [2019-11-28 15:38:26,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:27,013 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-28 15:38:27,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398156276] [2019-11-28 15:38:27,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770089100] [2019-11-28 15:38:27,015 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-28 15:38:27,060 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 15:38:27,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:27,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 15:38:27,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:27,191 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-28 15:38:27,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:27,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-28 15:38:27,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332034007] [2019-11-28 15:38:27,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 15:38:27,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 15:38:27,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-28 15:38:27,193 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 13 states. [2019-11-28 15:38:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:27,323 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-11-28 15:38:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:38:27,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-28 15:38:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:27,325 INFO L225 Difference]: With dead ends: 30 [2019-11-28 15:38:27,326 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 15:38:27,326 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-28 15:38:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 15:38:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-28 15:38:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 15:38:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-28 15:38:27,332 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 20 [2019-11-28 15:38:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:27,333 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 15:38:27,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 15:38:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-28 15:38:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:38:27,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:27,334 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2019-11-28 15:38:27,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:27,538 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash 77203631, now seen corresponding path program 6 times [2019-11-28 15:38:27,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:27,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098407021] [2019-11-28 15:38:27,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:27,670 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-28 15:38:27,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098407021] [2019-11-28 15:38:27,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671400541] [2019-11-28 15:38:27,671 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-28 15:38:27,725 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 15:38:27,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:27,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 15:38:27,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:27,976 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-28 15:38:27,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:27,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-28 15:38:27,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209517479] [2019-11-28 15:38:27,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 15:38:27,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 15:38:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-28 15:38:27,978 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 15 states. [2019-11-28 15:38:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:28,150 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-11-28 15:38:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 15:38:28,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-11-28 15:38:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:28,152 INFO L225 Difference]: With dead ends: 33 [2019-11-28 15:38:28,152 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 15:38:28,153 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-28 15:38:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 15:38:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-28 15:38:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 15:38:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-28 15:38:28,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 23 [2019-11-28 15:38:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:28,160 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 15:38:28,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 15:38:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-11-28 15:38:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:38:28,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:28,161 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1] [2019-11-28 15:38:28,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:28,368 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash -590105315, now seen corresponding path program 7 times [2019-11-28 15:38:28,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:28,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502463430] [2019-11-28 15:38:28,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:28,529 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-28 15:38:28,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502463430] [2019-11-28 15:38:28,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403274624] [2019-11-28 15:38:28,531 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-28 15:38:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:28,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 15:38:28,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:28,794 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-28 15:38:28,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:28,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-28 15:38:28,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092995437] [2019-11-28 15:38:28,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 15:38:28,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 15:38:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-28 15:38:28,796 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 17 states. [2019-11-28 15:38:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:28,993 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-11-28 15:38:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 15:38:28,994 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-11-28 15:38:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:28,995 INFO L225 Difference]: With dead ends: 36 [2019-11-28 15:38:28,995 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 15:38:28,995 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-28 15:38:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 15:38:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-28 15:38:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 15:38:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-11-28 15:38:29,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 26 [2019-11-28 15:38:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:29,002 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-28 15:38:29,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 15:38:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-11-28 15:38:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:38:29,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:29,003 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2019-11-28 15:38:29,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:29,210 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1012697583, now seen corresponding path program 8 times [2019-11-28 15:38:29,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:29,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228330086] [2019-11-28 15:38:29,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:29,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:38:29,264 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:38:29,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:38:29 BoogieIcfgContainer [2019-11-28 15:38:29,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:38:29,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:38:29,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:38:29,297 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:38:29,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:24" (3/4) ... [2019-11-28 15:38:29,301 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 15:38:29,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:38:29,304 INFO L168 Benchmark]: Toolchain (without parser) took 5845.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:29,309 INFO L168 Benchmark]: CDTParser took 0.74 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-28 15:38:29,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.31 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:29,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:29,311 INFO L168 Benchmark]: Boogie Preprocessor took 18.02 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-28 15:38:29,311 INFO L168 Benchmark]: RCFGBuilder took 225.42 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:29,312 INFO L168 Benchmark]: TraceAbstraction took 5202.07 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.0 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:29,313 INFO L168 Benchmark]: Witness Printer took 5.46 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-28 15:38:29,316 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.74 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 308.31 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 80.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.02 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 225.42 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5202.07 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.0 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.46 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.1s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 0.9s, 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.25-f470102 [2019-11-28 15:38:31,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:31,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:31,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:31,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:31,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:31,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:31,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:31,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:31,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:31,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:31,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:31,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:31,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:31,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:31,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:31,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:31,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:31,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:31,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:31,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:31,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:31,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:31,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:31,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:31,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:31,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:31,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:31,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:31,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:31,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:31,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:31,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:31,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:31,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:31,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:31,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:31,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:31,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:31,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:31,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:31,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 15:38:31,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:31,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:31,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:31,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:31,178 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:31,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:31,178 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:31,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:31,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:31,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:31,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:31,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:31,180 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 15:38:31,180 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 15:38:31,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:31,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:31,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:31,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:31,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:31,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:31,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:31,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:31,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:31,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:31,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:31,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:31,184 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 15:38:31,184 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 15:38:31,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:31,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:31,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 15:38:31,185 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-28 15:38:31,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:31,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:31,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:31,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:31,574 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:31,575 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-28 15:38:31,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f677da5a5/7ad043d09f50497eb3f042a1adc95909/FLAGff741b347 [2019-11-28 15:38:32,109 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:32,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2019-11-28 15:38:32,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f677da5a5/7ad043d09f50497eb3f042a1adc95909/FLAGff741b347 [2019-11-28 15:38:32,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f677da5a5/7ad043d09f50497eb3f042a1adc95909 [2019-11-28 15:38:32,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:32,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:32,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:32,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:32,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:32,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584170f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32, skipping insertion in model container [2019-11-28 15:38:32,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:32,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:32,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:32,718 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:32,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:32,757 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:32,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32 WrapperNode [2019-11-28 15:38:32,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:32,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:32,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:32,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:32,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:32,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:32,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:32,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:32,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:32,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:32,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:32,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:32,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (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-28 15:38:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:32,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:33,104 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:33,104 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:38:33,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:33 BoogieIcfgContainer [2019-11-28 15:38:33,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:33,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:33,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:33,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:33,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:32" (1/3) ... [2019-11-28 15:38:33,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4358848a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:33, skipping insertion in model container [2019-11-28 15:38:33,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (2/3) ... [2019-11-28 15:38:33,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4358848a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:33, skipping insertion in model container [2019-11-28 15:38:33,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:33" (3/3) ... [2019-11-28 15:38:33,113 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2019-11-28 15:38:33,122 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:33,129 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:38:33,142 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:38:33,168 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:33,168 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:33,169 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:33,169 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:33,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:33,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:33,172 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:33,172 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-11-28 15:38:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 15:38:33,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:33,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 15:38:33,193 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:33,197 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2019-11-28 15:38:33,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:33,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047960916] [2019-11-28 15:38:33,207 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-28 15:38:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:33,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 15:38:33,295 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:33,312 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-28 15:38:33,313 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:33,316 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-28 15:38:33,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047960916] [2019-11-28 15:38:33,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:33,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 15:38:33,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382656594] [2019-11-28 15:38:33,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 15:38:33,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 15:38:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:38:33,342 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-28 15:38:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:33,365 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-28 15:38:33,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 15:38:33,366 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-28 15:38:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:33,376 INFO L225 Difference]: With dead ends: 20 [2019-11-28 15:38:33,376 INFO L226 Difference]: Without dead ends: 8 [2019-11-28 15:38:33,379 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-28 15:38:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-28 15:38:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-28 15:38:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 15:38:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 15:38:33,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-11-28 15:38:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:33,418 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 15:38:33,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 15:38:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-11-28 15:38:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 15:38:33,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:33,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 15:38:33,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 15:38:33,632 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2019-11-28 15:38:33,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:33,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303575255] [2019-11-28 15:38:33,633 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-28 15:38:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:33,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:33,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:33,697 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-28 15:38:33,697 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:33,706 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-28 15:38:33,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303575255] [2019-11-28 15:38:33,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:33,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-28 15:38:33,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054856152] [2019-11-28 15:38:33,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:38:33,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:38:33,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:33,710 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-11-28 15:38:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:33,739 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-28 15:38:33,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:38:33,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-28 15:38:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:33,741 INFO L225 Difference]: With dead ends: 16 [2019-11-28 15:38:33,741 INFO L226 Difference]: Without dead ends: 12 [2019-11-28 15:38:33,743 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-28 15:38:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-28 15:38:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 15:38:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 15:38:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-28 15:38:33,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2019-11-28 15:38:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:33,748 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-28 15:38:33,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:38:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-11-28 15:38:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 15:38:33,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:33,749 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 15:38:33,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 15:38:33,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1123862993, now seen corresponding path program 1 times [2019-11-28 15:38:33,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:33,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80025946] [2019-11-28 15:38:33,963 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-28 15:38:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:33,991 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 15:38:33,992 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:34,036 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-28 15:38:34,037 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:34,107 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-28 15:38:34,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80025946] [2019-11-28 15:38:34,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:34,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 15:38:34,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327240524] [2019-11-28 15:38:34,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:38:34,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:38:34,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:38:34,112 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-11-28 15:38:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:34,346 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-11-28 15:38:34,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 15:38:34,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 15:38:34,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:34,349 INFO L225 Difference]: With dead ends: 41 [2019-11-28 15:38:34,349 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 15:38:34,350 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-28 15:38:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 15:38:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2019-11-28 15:38:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 15:38:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 15:38:34,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 11 [2019-11-28 15:38:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:34,358 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 15:38:34,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:38:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-11-28 15:38:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 15:38:34,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:34,359 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:34,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 15:38:34,578 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1066604691, now seen corresponding path program 1 times [2019-11-28 15:38:34,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:34,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579058660] [2019-11-28 15:38:34,581 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-28 15:38:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:34,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:38:34,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:34,662 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-28 15:38:34,663 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:34,715 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-28 15:38:34,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579058660] [2019-11-28 15:38:34,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:34,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-28 15:38:34,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624118887] [2019-11-28 15:38:34,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:38:34,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:38:34,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:38:34,726 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 8 states. [2019-11-28 15:38:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:34,867 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-28 15:38:34,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:38:34,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-11-28 15:38:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:34,869 INFO L225 Difference]: With dead ends: 28 [2019-11-28 15:38:34,870 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 15:38:34,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:38:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 15:38:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 15:38:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 15:38:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-28 15:38:34,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2019-11-28 15:38:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:34,879 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-28 15:38:34,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:38:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-28 15:38:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:38:34,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:34,880 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1] [2019-11-28 15:38:35,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 15:38:35,099 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1658775637, now seen corresponding path program 2 times [2019-11-28 15:38:35,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:35,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181303024] [2019-11-28 15:38:35,102 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-28 15:38:35,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:38:35,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:35,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 15:38:35,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:35,240 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-28 15:38:35,240 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:35,398 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-28 15:38:35,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181303024] [2019-11-28 15:38:35,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:35,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-28 15:38:35,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56400547] [2019-11-28 15:38:35,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 15:38:35,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 15:38:35,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-28 15:38:35,404 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 13 states. [2019-11-28 15:38:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:36,043 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-28 15:38:36,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 15:38:36,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-28 15:38:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:36,045 INFO L225 Difference]: With dead ends: 75 [2019-11-28 15:38:36,046 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 15:38:36,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-11-28 15:38:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 15:38:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2019-11-28 15:38:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 15:38:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-11-28 15:38:36,066 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 23 [2019-11-28 15:38:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:36,068 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-11-28 15:38:36,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 15:38:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-11-28 15:38:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:38:36,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:36,071 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1] [2019-11-28 15:38:36,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 15:38:36,283 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:36,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:36,283 INFO L82 PathProgramCache]: Analyzing trace with hash -978717267, now seen corresponding path program 3 times [2019-11-28 15:38:36,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:36,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120213504] [2019-11-28 15:38:36,285 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-28 15:38:36,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 15:38:36,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:36,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 15:38:36,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:36,403 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-28 15:38:36,403 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:36,519 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-28 15:38:36,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120213504] [2019-11-28 15:38:36,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:36,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-28 15:38:36,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40069558] [2019-11-28 15:38:36,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 15:38:36,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:36,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 15:38:36,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:38:36,522 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 10 states. [2019-11-28 15:38:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:36,786 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2019-11-28 15:38:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 15:38:36,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 15:38:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:36,790 INFO L225 Difference]: With dead ends: 86 [2019-11-28 15:38:36,790 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 15:38:36,792 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-28 15:38:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 15:38:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-11-28 15:38:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 15:38:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-11-28 15:38:36,806 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 23 [2019-11-28 15:38:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:36,807 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-11-28 15:38:36,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 15:38:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-11-28 15:38:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:38:36,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:36,808 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1] [2019-11-28 15:38:37,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 15:38:37,018 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:37,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash -921458965, now seen corresponding path program 4 times [2019-11-28 15:38:37,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:37,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143502439] [2019-11-28 15:38:37,021 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-28 15:38:37,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 15:38:37,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:37,045 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 15:38:37,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:37,142 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-28 15:38:37,142 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:37,347 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-28 15:38:37,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143502439] [2019-11-28 15:38:37,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:37,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-28 15:38:37,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704676198] [2019-11-28 15:38:37,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 15:38:37,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:37,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 15:38:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-28 15:38:37,351 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 16 states. [2019-11-28 15:38:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:37,654 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-11-28 15:38:37,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 15:38:37,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-28 15:38:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:37,656 INFO L225 Difference]: With dead ends: 80 [2019-11-28 15:38:37,656 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 15:38:37,657 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-28 15:38:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 15:38:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 15:38:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 15:38:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-28 15:38:37,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 23 [2019-11-28 15:38:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:37,665 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-28 15:38:37,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 15:38:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-28 15:38:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:38:37,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:37,666 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1] [2019-11-28 15:38:37,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 15:38:37,886 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:37,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1658007635, now seen corresponding path program 5 times [2019-11-28 15:38:37,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:37,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564164559] [2019-11-28 15:38:37,887 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-28 15:38:37,926 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 15:38:37,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:37,928 WARN L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 15:38:37,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:39,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:38:39,337 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-28 15:38:39,337 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:41,604 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-28 15:38:41,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564164559] [2019-11-28 15:38:41,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:41,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2019-11-28 15:38:41,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429936611] [2019-11-28 15:38:41,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-28 15:38:41,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-28 15:38:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1391, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 15:38:41,608 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 41 states. [2019-11-28 15:38:41,904 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 39 [2019-11-28 15:38:42,153 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 41 [2019-11-28 15:38:42,938 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 58 [2019-11-28 15:38:45,311 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 91 [2019-11-28 15:38:45,704 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 95 [2019-11-28 15:38:46,083 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 85 [2019-11-28 15:38:46,409 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 89 [2019-11-28 15:38:46,911 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 105 [2019-11-28 15:38:47,273 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-28 15:38:47,664 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-11-28 15:38:47,977 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-28 15:38:48,326 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-11-28 15:38:48,712 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-11-28 15:38:48,987 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-28 15:38:49,486 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-11-28 15:38:49,826 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-11-28 15:38:50,099 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-28 15:38:50,494 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-11-28 15:38:50,772 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-11-28 15:38:51,727 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-28 15:38:51,981 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-28 15:38:53,482 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-11-28 15:38:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:53,496 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-28 15:38:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-28 15:38:53,497 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 29 [2019-11-28 15:38:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:53,498 INFO L225 Difference]: With dead ends: 91 [2019-11-28 15:38:53,499 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 15:38:53,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=1078, Invalid=6232, Unknown=0, NotChecked=0, Total=7310 [2019-11-28 15:38:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 15:38:53,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2019-11-28 15:38:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 15:38:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-11-28 15:38:53,514 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 29 [2019-11-28 15:38:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:53,514 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-11-28 15:38:53,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-28 15:38:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-11-28 15:38:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 15:38:53,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:53,517 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 12, 7, 1, 1, 1, 1, 1] [2019-11-28 15:38:53,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 15:38:53,728 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 53203109, now seen corresponding path program 6 times [2019-11-28 15:38:53,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:53,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518877683] [2019-11-28 15:38:53,730 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-28 15:38:53,766 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-28 15:38:53,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:38:53,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 15:38:53,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:53,971 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-28 15:38:53,972 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:54,375 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-28 15:38:54,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518877683] [2019-11-28 15:38:54,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:54,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-28 15:38:54,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985721014] [2019-11-28 15:38:54,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 15:38:54,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 15:38:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-11-28 15:38:54,377 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 18 states. [2019-11-28 15:38:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,183 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-11-28 15:38:55,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 15:38:55,184 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2019-11-28 15:38:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,185 INFO L225 Difference]: With dead ends: 72 [2019-11-28 15:38:55,185 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:38:55,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-11-28 15:38:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:38:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:38:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:38:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:38:55,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2019-11-28 15:38:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,187 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:38:55,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 15:38:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:38:55,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:38:55,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 15:38:55,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:38:55,593 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 270 [2019-11-28 15:38:56,866 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 267 DAG size of output: 192 [2019-11-28 15:38:56,872 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:38:56,873 INFO L249 CegarLoopResult]: At program point L31(lines 12 32) the Hoare annotation is: true [2019-11-28 15:38:56,874 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-28 15:38:56,875 INFO L246 CegarLoopResult]: For program point L21-3(lines 21 28) no Hoare annotation was computed. [2019-11-28 15:38:56,875 INFO L246 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-11-28 15:38:56,875 INFO L249 CegarLoopResult]: At program point L5-2(lines 4 9) the Hoare annotation is: true [2019-11-28 15:38:56,875 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:38:56,875 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:38:56,876 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-28 15:38:56,876 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-28 15:38:56,876 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2019-11-28 15:38:56,876 INFO L246 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-28 15:38:56,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-28 15:38:56,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-28 15:38:56,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-28 15:38:56,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-28 15:38:56,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:56,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:56,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:38:56 BoogieIcfgContainer [2019-11-28 15:38:56,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:38:56,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:38:56,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:38:56,967 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:38:56,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:33" (3/4) ... [2019-11-28 15:38:56,971 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:38:56,988 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:38:56,988 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:38:57,020 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-28 15:38:57,035 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:38:57,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:38:57,037 INFO L168 Benchmark]: Toolchain (without parser) took 24545.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 963.0 MB in the beginning and 1.0 GB in the end (delta: -51.6 MB). Peak memory consumption was 247.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:57,037 INFO L168 Benchmark]: CDTParser took 0.24 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-28 15:38:57,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.30 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:57,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:57,039 INFO L168 Benchmark]: Boogie Preprocessor took 23.80 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-28 15:38:57,039 INFO L168 Benchmark]: RCFGBuilder took 229.88 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:57,040 INFO L168 Benchmark]: TraceAbstraction took 23859.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.9 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:57,040 INFO L168 Benchmark]: Witness Printer took 69.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:57,044 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.24 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 265.30 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 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 92.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.80 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 229.88 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23859.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.9 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. * Witness Printer took 69.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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-28 15:38:57,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-28 15:38:57,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-28 15:38:57,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-28 15:38:57,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_27,QUANTIFIED] [2019-11-28 15:38:57,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_60,QUANTIFIED] [2019-11-28 15:38:57,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_45,QUANTIFIED] [2019-11-28 15:38:57,093 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: 22.2s, OverallIterations: 9, TraceHistogramMax: 19, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 64 SDtfs, 482 SDslu, 200 SDs, 0 SdLazy, 1055 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 262 SyntacticMatches, 3 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 16.5s 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s 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...