./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.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 308e43cca528a064aecd41d099b341627e43bb71 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.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 308e43cca528a064aecd41d099b341627e43bb71 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:23:52,166 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:23:52,169 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:23:52,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:23:52,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:23:52,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:23:52,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:23:52,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:23:52,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:23:52,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:23:52,190 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:23:52,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:23:52,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:23:52,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:23:52,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:23:52,195 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:23:52,195 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:23:52,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:23:52,207 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:23:52,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:23:52,210 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:23:52,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:23:52,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:23:52,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:23:52,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:23:52,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:23:52,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:23:52,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:23:52,225 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:23:52,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:23:52,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:23:52,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:23:52,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:23:52,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:23:52,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:23:52,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:23:52,229 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:23:52,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:23:52,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:23:52,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:23:52,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:23:52,245 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:23:52,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:23:52,245 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:23:52,245 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:23:52,245 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:23:52,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:23:52,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:23:52,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:23:52,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:23:52,246 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:23:52,246 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:23:52,247 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:23:52,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:23:52,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:23:52,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:23:52,247 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:23:52,247 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:23:52,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:23:52,248 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:23:52,248 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:23:52,248 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:23:52,248 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:23:52,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:23:52,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:23:52,249 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-12-31 04:23:52,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:23:52,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:23:52,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:23:52,312 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:23:52,313 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:23:52,313 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c [2018-12-31 04:23:52,378 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbcb6b07a/a73a37f9a9c745a095f3d24718551709/FLAG477fba964 [2018-12-31 04:23:52,815 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:23:52,815 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c [2018-12-31 04:23:52,823 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbcb6b07a/a73a37f9a9c745a095f3d24718551709/FLAG477fba964 [2018-12-31 04:23:53,149 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbcb6b07a/a73a37f9a9c745a095f3d24718551709 [2018-12-31 04:23:53,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:23:53,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:23:53,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:23:53,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:23:53,161 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:23:53,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33572162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53, skipping insertion in model container [2018-12-31 04:23:53,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:23:53,194 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:23:53,452 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:23:53,473 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:23:53,505 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:23:53,535 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:23:53,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53 WrapperNode [2018-12-31 04:23:53,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:23:53,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:23:53,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:23:53,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:23:53,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:23:53,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:23:53,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:23:53,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:23:53,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... [2018-12-31 04:23:53,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:23:53,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:23:53,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:23:53,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:23:53,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:23:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:23:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:23:53,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:23:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:23:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:23:54,280 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:23:54,280 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-12-31 04:23:54,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:54 BoogieIcfgContainer [2018-12-31 04:23:54,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:23:54,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:23:54,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:23:54,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:23:54,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:23:53" (1/3) ... [2018-12-31 04:23:54,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab0c097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:23:54, skipping insertion in model container [2018-12-31 04:23:54,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:53" (2/3) ... [2018-12-31 04:23:54,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab0c097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:23:54, skipping insertion in model container [2018-12-31 04:23:54,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:54" (3/3) ... [2018-12-31 04:23:54,289 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-12-31 04:23:54,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:23:54,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:23:54,326 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:23:54,359 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:23:54,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:23:54,360 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:23:54,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:23:54,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:23:54,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:23:54,361 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:23:54,361 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:23:54,361 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:23:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-31 04:23:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:23:54,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:54,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:54,396 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:54,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2100293056, now seen corresponding path program 1 times [2018-12-31 04:23:54,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:54,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:54,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:54,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:54,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:23:54,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:23:54,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:23:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:23:54,589 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-12-31 04:23:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:54,605 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-31 04:23:54,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:23:54,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-12-31 04:23:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:54,617 INFO L225 Difference]: With dead ends: 30 [2018-12-31 04:23:54,617 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 04:23:54,620 INFO L631 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 [2018-12-31 04:23:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 04:23:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 04:23:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 04:23:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-31 04:23:54,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-12-31 04:23:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:54,657 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-31 04:23:54,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:23:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-31 04:23:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:23:54,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:54,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:54,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:54,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash 478567452, now seen corresponding path program 1 times [2018-12-31 04:23:54,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:54,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:54,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:54,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:54,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:55,056 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-12-31 04:23:55,604 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-12-31 04:23:55,885 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-12-31 04:23:56,174 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-12-31 04:23:56,781 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 5 [2018-12-31 04:23:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:57,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:57,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-31 04:23:57,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 04:23:57,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 04:23:57,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:23:57,235 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 14 states. [2018-12-31 04:23:57,925 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2018-12-31 04:23:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:58,399 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-31 04:23:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:23:58,400 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-12-31 04:23:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:58,404 INFO L225 Difference]: With dead ends: 36 [2018-12-31 04:23:58,404 INFO L226 Difference]: Without dead ends: 31 [2018-12-31 04:23:58,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-31 04:23:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-31 04:23:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-31 04:23:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 04:23:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-12-31 04:23:58,413 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-12-31 04:23:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:58,413 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-31 04:23:58,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 04:23:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-12-31 04:23:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 04:23:58,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:58,415 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:58,415 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1851619425, now seen corresponding path program 1 times [2018-12-31 04:23:58,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:58,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:58,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:58,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:58,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:58,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:58,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:59,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:59,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:59,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 04:23:59,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:23:59,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:59,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:59,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:23:59,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-12-31 04:23:59,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-31 04:23:59,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-31 04:23:59,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:59,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:59,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:59,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-31 04:23:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:59,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:59,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-12-31 04:23:59,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 04:23:59,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 04:23:59,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-12-31 04:23:59,657 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 22 states. [2018-12-31 04:24:01,709 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-12-31 04:24:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:02,230 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-12-31 04:24:02,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-31 04:24:02,233 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 18 [2018-12-31 04:24:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:02,234 INFO L225 Difference]: With dead ends: 75 [2018-12-31 04:24:02,234 INFO L226 Difference]: Without dead ends: 70 [2018-12-31 04:24:02,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=470, Invalid=1786, Unknown=0, NotChecked=0, Total=2256 [2018-12-31 04:24:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-31 04:24:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 29. [2018-12-31 04:24:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 04:24:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-31 04:24:02,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2018-12-31 04:24:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:02,247 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-31 04:24:02,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 04:24:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-31 04:24:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 04:24:02,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:02,248 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:02,248 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:02,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1211257704, now seen corresponding path program 1 times [2018-12-31 04:24:02,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:24:02,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:24:02,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:02,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:02,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 04:24:02,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:24:02,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 04:24:02,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 04:24:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 04:24:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:24:02,363 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2018-12-31 04:24:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:02,772 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-31 04:24:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:24:02,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-12-31 04:24:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:02,776 INFO L225 Difference]: With dead ends: 70 [2018-12-31 04:24:02,776 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 04:24:02,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:24:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 04:24:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 29. [2018-12-31 04:24:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 04:24:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-31 04:24:02,789 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2018-12-31 04:24:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:02,790 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-31 04:24:02,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 04:24:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-31 04:24:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 04:24:02,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:02,791 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:02,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 200140454, now seen corresponding path program 1 times [2018-12-31 04:24:02,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:24:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:24:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:02,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:03,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:24:03,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:24:03,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:03,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:03,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 04:24:03,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:24:03,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:03,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:03,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:03,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-12-31 04:24:03,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-31 04:24:03,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-31 04:24:03,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:03,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:03,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:03,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-31 04:24:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:03,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:24:03,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2018-12-31 04:24:03,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 04:24:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 04:24:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-31 04:24:03,628 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 18 states. [2018-12-31 04:24:03,897 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-12-31 04:24:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:05,150 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-31 04:24:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 04:24:05,154 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2018-12-31 04:24:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:05,155 INFO L225 Difference]: With dead ends: 67 [2018-12-31 04:24:05,155 INFO L226 Difference]: Without dead ends: 62 [2018-12-31 04:24:05,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2018-12-31 04:24:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-31 04:24:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 33. [2018-12-31 04:24:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 04:24:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-31 04:24:05,170 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2018-12-31 04:24:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:05,170 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-31 04:24:05,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 04:24:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-31 04:24:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 04:24:05,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:05,171 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:05,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1013708501, now seen corresponding path program 2 times [2018-12-31 04:24:05,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:24:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:24:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:05,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:05,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:24:05,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:24:05,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:24:05,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:24:05,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:24:05,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:05,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 04:24:05,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-31 04:24:05,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:05,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:05,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:05,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-31 04:24:06,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-31 04:24:06,042 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 04:24:06,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-31 04:24:06,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:06,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:06,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:06,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:5 [2018-12-31 04:24:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:06,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:24:06,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-12-31 04:24:06,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-31 04:24:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-31 04:24:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-12-31 04:24:06,181 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 26 states. [2018-12-31 04:24:10,069 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-31 04:24:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:10,543 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-12-31 04:24:10,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-31 04:24:10,545 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 22 [2018-12-31 04:24:10,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:10,548 INFO L225 Difference]: With dead ends: 83 [2018-12-31 04:24:10,548 INFO L226 Difference]: Without dead ends: 78 [2018-12-31 04:24:10,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1097, Invalid=3733, Unknown=0, NotChecked=0, Total=4830 [2018-12-31 04:24:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-31 04:24:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 37. [2018-12-31 04:24:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-31 04:24:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-31 04:24:10,570 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2018-12-31 04:24:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:10,571 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-31 04:24:10,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-31 04:24:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-31 04:24:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:24:10,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:10,572 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:10,572 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -372767691, now seen corresponding path program 2 times [2018-12-31 04:24:10,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:24:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:24:10,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:10,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:24:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:11,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:24:11,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:24:11,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:24:11,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:24:11,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:24:11,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:11,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 04:24:11,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:24:11,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:11,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:11,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:11,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-12-31 04:24:11,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-31 04:24:11,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-31 04:24:11,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:11,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:11,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:11,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-31 04:24:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:11,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:24:11,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2018-12-31 04:24:11,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-31 04:24:11,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-31 04:24:11,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-12-31 04:24:11,865 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 30 states. [2018-12-31 04:24:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:14,030 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-12-31 04:24:14,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-31 04:24:14,031 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2018-12-31 04:24:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:14,032 INFO L225 Difference]: With dead ends: 93 [2018-12-31 04:24:14,032 INFO L226 Difference]: Without dead ends: 88 [2018-12-31 04:24:14,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=686, Invalid=2070, Unknown=0, NotChecked=0, Total=2756 [2018-12-31 04:24:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-31 04:24:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 43. [2018-12-31 04:24:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-31 04:24:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-12-31 04:24:14,053 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 26 [2018-12-31 04:24:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:14,053 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-12-31 04:24:14,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-31 04:24:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-12-31 04:24:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 04:24:14,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:14,054 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:14,055 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1043903553, now seen corresponding path program 3 times [2018-12-31 04:24:14,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:24:14,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:24:14,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:14,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:24:14,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:14,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:24:14,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:24:14,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 04:24:14,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 04:24:14,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:24:14,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:14,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 04:24:14,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-31 04:24:14,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:14,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:14,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:14,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-12-31 04:24:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 04:24:15,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:24:15,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-12-31 04:24:15,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-31 04:24:15,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-31 04:24:15,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-12-31 04:24:15,114 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 32 states. [2018-12-31 04:24:16,755 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-12-31 04:24:17,252 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-12-31 04:24:17,883 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-12-31 04:24:18,619 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-12-31 04:24:19,282 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-12-31 04:24:19,916 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-12-31 04:24:21,197 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-12-31 04:24:23,129 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-31 04:24:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:23,148 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-12-31 04:24:23,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-31 04:24:23,149 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2018-12-31 04:24:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:23,149 INFO L225 Difference]: With dead ends: 93 [2018-12-31 04:24:23,149 INFO L226 Difference]: Without dead ends: 37 [2018-12-31 04:24:23,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2388 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1836, Invalid=7434, Unknown=42, NotChecked=0, Total=9312 [2018-12-31 04:24:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-31 04:24:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-31 04:24:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-31 04:24:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-31 04:24:23,175 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 30 [2018-12-31 04:24:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:23,176 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-31 04:24:23,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-31 04:24:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-31 04:24:23,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 04:24:23,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:23,178 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:23,179 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash 365314510, now seen corresponding path program 3 times [2018-12-31 04:24:23,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:24:23,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:24:23,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:23,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:24:23,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:24:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:23,878 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-31 04:24:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:24,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:24:24,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:24:24,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 04:24:24,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 04:24:24,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:24:24,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:24,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:24:24,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:24:24,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:24,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:24,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:24,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-31 04:24:24,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 04:24:24,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-31 04:24:24,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:24,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:24,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:24,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-12-31 04:24:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 04:24:24,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:24:24,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2018-12-31 04:24:24,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-31 04:24:24,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-31 04:24:24,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-12-31 04:24:24,675 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 29 states. [2018-12-31 04:24:27,847 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-31 04:24:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:28,685 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-31 04:24:28,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-31 04:24:28,686 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-12-31 04:24:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:28,687 INFO L225 Difference]: With dead ends: 39 [2018-12-31 04:24:28,687 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:24:28,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=577, Invalid=2951, Unknown=12, NotChecked=0, Total=3540 [2018-12-31 04:24:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:24:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:24:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:24:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:24:28,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-12-31 04:24:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:28,691 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:24:28,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-31 04:24:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:24:28,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:24:28,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:24:28,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:24:28,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:24:29,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:24:29,281 WARN L181 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 258 [2018-12-31 04:24:29,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:24:29,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:24:32,560 WARN L181 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 254 DAG size of output: 60 [2018-12-31 04:24:32,744 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-12-31 04:24:33,065 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2018-12-31 04:24:33,150 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-12-31 04:24:33,150 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-12-31 04:24:33,150 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 21 24) the Hoare annotation is: (let ((.cse0 (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#d1~0.base|) (+ |~#d1~0.offset| 4) 0) |~#d1~0.offset| 0))) (.cse1 (= 0 |~#d2~0.offset|)) (.cse2 (= 0 |~#d1~0.offset|))) (or (and .cse0 .cse1 (= |~#d2~0.base| |ULTIMATE.start_get_dummy_#res.base|) (= 0 |ULTIMATE.start_get_dummy_#res.offset|) .cse2 (not (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (and .cse0 .cse1 (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) .cse2 (= |ULTIMATE.start_get_dummy_#res.base| |~#d1~0.base|)))) [2018-12-31 04:24:33,150 INFO L448 ceAbstractionStarter]: For program point L23-4(line 23) no Hoare annotation was computed. [2018-12-31 04:24:33,150 INFO L448 ceAbstractionStarter]: For program point L23-6(line 23) no Hoare annotation was computed. [2018-12-31 04:24:33,151 INFO L444 ceAbstractionStarter]: At program point L23-7(lines 21 24) the Hoare annotation is: (let ((.cse1 (= 0 |~#d2~0.offset|)) (.cse0 (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#d1~0.base|) (+ |~#d1~0.offset| 4) 0) |~#d1~0.offset| 0))) (.cse2 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse3 (= 0 |~#d1~0.offset|))) (or (and (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) (and (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0) .cse1 .cse2) .cse3) (and .cse0 .cse1 (= |~#d2~0.base| |ULTIMATE.start_get_dummy_#res.base|) (= 0 |ULTIMATE.start_get_dummy_#res.offset|) (= ULTIMATE.start_main_~pd1~0.offset 0) .cse3 (not (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (and (not (= |~#d1~0.base| ULTIMATE.start_main_~pd1~0.base)) .cse0 .cse2 .cse3 (not (= |ULTIMATE.start_get_dummy_#res.base| ULTIMATE.start_main_~pd1~0.base))))) [2018-12-31 04:24:33,151 INFO L444 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: false [2018-12-31 04:24:33,151 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-12-31 04:24:33,151 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse1 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse2 (and (= 0 |~#d2~0.offset|) (and (not (= |~#d1~0.base| |~#d2~0.base|)) (and (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pd1~0.base) (<= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|))))) (.cse5 (<= ULTIMATE.start_main_~pd1~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse1 .cse2 (exists ((v_ULTIMATE.start_main_~i~0_25 Int)) (let ((.cse4 (* 4 v_ULTIMATE.start_main_~i~0_25))) (let ((.cse3 (+ .cse4 ULTIMATE.start_main_~pd2~0.offset 8))) (and (= v_ULTIMATE.start_main_~i~0_25 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse3)) (<= .cse3 ULTIMATE.start_main_~pa~0.offset) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse4 8)))))) .cse5) (and .cse0 (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|) (exists ((v_ULTIMATE.start_main_~i~0_27 Int)) (let ((.cse7 (* 4 v_ULTIMATE.start_main_~i~0_27))) (let ((.cse6 (+ .cse7 ULTIMATE.start_main_~pd2~0.offset 8))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse6) v_ULTIMATE.start_main_~i~0_27) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse7 8)) (<= .cse6 ULTIMATE.start_main_~pa~0.offset))))) (= 0 |ULTIMATE.start_get_dummy_#res.offset|) .cse1 (<= 0 ULTIMATE.start_main_~pd2~0.offset) .cse2 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse5))) [2018-12-31 04:24:33,151 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2018-12-31 04:24:33,151 INFO L448 ceAbstractionStarter]: For program point L40-4(lines 40 42) no Hoare annotation was computed. [2018-12-31 04:24:33,152 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2018-12-31 04:24:33,152 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:24:33,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:24:33,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:24:33,152 INFO L444 ceAbstractionStarter]: At program point L28(lines 26 29) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse2 (= 0 |~#d2~0.offset|)) (.cse7 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse0 (and (not (= |~#d1~0.base| |~#d2~0.base|)) (and (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pd1~0.base) (<= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|)))) (.cse8 (= 1 |ULTIMATE.start_check_#res|)) (.cse11 (<= ULTIMATE.start_main_~pd1~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 (exists ((v_ULTIMATE.start_main_~i~0_25 Int) (ULTIMATE.start_main_~pa~0.offset Int)) (let ((.cse4 (select |#memory_int| ULTIMATE.start_main_~pd2~0.base)) (.cse5 (* 4 v_ULTIMATE.start_main_~i~0_25))) (let ((.cse3 (+ .cse5 ULTIMATE.start_main_~pd2~0.offset 8)) (.cse6 (select .cse4 ULTIMATE.start_main_~pa~0.offset))) (and (<= .cse3 ULTIMATE.start_main_~pa~0.offset) (= (select .cse4 .cse3) v_ULTIMATE.start_main_~i~0_25) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse5 8)) (<= .cse6 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 .cse6))))) (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse8 (exists ((v_ULTIMATE.start_main_~i~0_25 Int)) (let ((.cse10 (* 4 v_ULTIMATE.start_main_~i~0_25))) (let ((.cse9 (+ .cse10 ULTIMATE.start_main_~pd2~0.offset 8))) (and (= v_ULTIMATE.start_main_~i~0_25 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse9)) (<= .cse9 ULTIMATE.start_main_~pa~0.offset) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse10 8)))))) .cse11) (and .cse1 (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|) .cse2 (exists ((v_ULTIMATE.start_main_~i~0_27 Int)) (let ((.cse13 (* 4 v_ULTIMATE.start_main_~i~0_27))) (let ((.cse12 (+ .cse13 ULTIMATE.start_main_~pd2~0.offset 8))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse12) v_ULTIMATE.start_main_~i~0_27) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse13 8)) (<= .cse12 ULTIMATE.start_main_~pa~0.offset))))) (= 0 |ULTIMATE.start_get_dummy_#res.offset|) .cse7 (= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (+ (* 4 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~pd2~0.offset 8)))) .cse0 (<= 0 ULTIMATE.start_main_~pd2~0.offset) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse8 .cse11))) [2018-12-31 04:24:33,152 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-12-31 04:24:33,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:24:33,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2018-12-31 04:24:33,158 INFO L451 ceAbstractionStarter]: At program point L51(lines 31 52) the Hoare annotation is: true [2018-12-31 04:24:33,158 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 45) no Hoare annotation was computed. [2018-12-31 04:24:33,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,188 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-31 04:24:33,191 INFO L168 Benchmark]: Toolchain (without parser) took 40037.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.9 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -399.3 MB). Peak memory consumption was 487.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:33,199 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:24:33,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.74 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:33,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.37 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:33,200 INFO L168 Benchmark]: Boogie Preprocessor took 159.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 929.9 MB in the beginning and 1.2 GB in the end (delta: -220.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:33,201 INFO L168 Benchmark]: RCFGBuilder took 526.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:33,202 INFO L168 Benchmark]: TraceAbstraction took 38908.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.3 MB). Peak memory consumption was 510.2 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:33,207 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.74 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.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 56.37 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 159.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 929.9 MB in the beginning and 1.2 GB in the end (delta: -220.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 526.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38908.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.3 MB). Peak memory consumption was 510.2 MB. 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_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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: 40]: Loop Invariant [2018-12-31 04:24:33,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2018-12-31 04:24:33,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2018-12-31 04:24:33,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:33,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((pd1 == d1 && i <= unknown-#memory_int-unknown[pa][pa]) && d1 == pd1) && pd2 == pa) && 0 == d2 && !(d1 == d2) && (pd2 == pd1 && pd2 <= pd1) && 0 == d1) && (\exists v_ULTIMATE.start_main_~i~0_25 : int :: (v_ULTIMATE.start_main_~i~0_25 == unknown-#memory_int-unknown[pa][4 * v_ULTIMATE.start_main_~i~0_25 + pd2 + 8] && 4 * v_ULTIMATE.start_main_~i~0_25 + pd2 + 8 <= pa) && pa <= 4 * v_ULTIMATE.start_main_~i~0_25 + 8)) && pd1 <= pd2) || ((((((((i <= unknown-#memory_int-unknown[pa][pa] && pd1 == \result) && (\exists v_ULTIMATE.start_main_~i~0_27 : int :: (unknown-#memory_int-unknown[pa][4 * v_ULTIMATE.start_main_~i~0_27 + pd2 + 8] == v_ULTIMATE.start_main_~i~0_27 && pa <= 4 * v_ULTIMATE.start_main_~i~0_27 + 8) && 4 * v_ULTIMATE.start_main_~i~0_27 + pd2 + 8 <= pa)) && 0 == \result) && pd2 == pa) && 0 <= pd2) && 0 == d2 && !(d1 == d2) && (pd2 == pd1 && pd2 <= pd1) && 0 == d1) && pd1 == d2) && pd1 <= pd2) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:24:35,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:24:35,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:24:35,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:24:35,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:24:35,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:24:35,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:24:35,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:24:35,639 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:24:35,640 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:24:35,641 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:24:35,642 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:24:35,643 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:24:35,644 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:24:35,646 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:24:35,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:24:35,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:24:35,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:24:35,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:24:35,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:24:35,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:24:35,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:24:35,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:24:35,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:24:35,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:24:35,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:24:35,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:24:35,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:24:35,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:24:35,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:24:35,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:24:35,668 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:24:35,668 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:24:35,669 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:24:35,670 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:24:35,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:24:35,671 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 04:24:35,687 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:24:35,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:24:35,689 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:24:35,689 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:24:35,689 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:24:35,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:24:35,690 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:24:35,690 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:24:35,691 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:24:35,691 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:24:35,691 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:24:35,691 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:24:35,691 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 04:24:35,691 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 04:24:35,692 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:24:35,692 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:24:35,692 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:24:35,692 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:24:35,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:24:35,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:24:35,694 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:24:35,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:24:35,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:24:35,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:24:35,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:24:35,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:24:35,695 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 04:24:35,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:24:35,695 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 04:24:35,697 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 04:24:35,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-12-31 04:24:35,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:24:35,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:24:35,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:24:35,752 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:24:35,752 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:24:35,753 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c [2018-12-31 04:24:35,811 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a67593d/28dad652caef42ab84b9fa631c2399bc/FLAGc7b6bc96b [2018-12-31 04:24:36,285 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:24:36,285 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c [2018-12-31 04:24:36,292 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a67593d/28dad652caef42ab84b9fa631c2399bc/FLAGc7b6bc96b [2018-12-31 04:24:36,625 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a67593d/28dad652caef42ab84b9fa631c2399bc [2018-12-31 04:24:36,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:24:36,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:24:36,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:24:36,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:24:36,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:24:36,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:24:36" (1/1) ... [2018-12-31 04:24:36,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba3f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:36, skipping insertion in model container [2018-12-31 04:24:36,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:24:36" (1/1) ... [2018-12-31 04:24:36,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:24:36,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:24:36,955 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:24:36,984 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:24:37,018 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:24:37,051 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:24:37,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37 WrapperNode [2018-12-31 04:24:37,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:24:37,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:24:37,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:24:37,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:24:37,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:24:37,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:24:37,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:24:37,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:24:37,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (1/1) ... [2018-12-31 04:24:37,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:24:37,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:24:37,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:24:37,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:24:37,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (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 [2018-12-31 04:24:37,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 04:24:37,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:24:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:24:37,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:24:37,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 04:24:37,755 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:24:37,755 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-12-31 04:24:37,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:24:37 BoogieIcfgContainer [2018-12-31 04:24:37,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:24:37,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:24:37,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:24:37,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:24:37,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:24:36" (1/3) ... [2018-12-31 04:24:37,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b81aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:24:37, skipping insertion in model container [2018-12-31 04:24:37,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:24:37" (2/3) ... [2018-12-31 04:24:37,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b81aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:24:37, skipping insertion in model container [2018-12-31 04:24:37,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:24:37" (3/3) ... [2018-12-31 04:24:37,767 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-12-31 04:24:37,777 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:24:37,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:24:37,803 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:24:37,836 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:24:37,837 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:24:37,837 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:24:37,837 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:24:37,838 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:24:37,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:24:37,838 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:24:37,838 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:24:37,839 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:24:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-31 04:24:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:24:37,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:37,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:37,868 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2100293056, now seen corresponding path program 1 times [2018-12-31 04:24:37,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:24:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:24:37,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:37,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:38,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:24:38,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:24:38,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:24:38,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:24:38,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:24:38,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:24:38,032 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-12-31 04:24:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:38,047 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-31 04:24:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:24:38,050 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-12-31 04:24:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:38,060 INFO L225 Difference]: With dead ends: 30 [2018-12-31 04:24:38,060 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 04:24:38,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:24:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 04:24:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 04:24:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 04:24:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-31 04:24:38,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-12-31 04:24:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:38,097 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-31 04:24:38,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:24:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-31 04:24:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:24:38,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:38,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:38,099 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash 478567452, now seen corresponding path program 1 times [2018-12-31 04:24:38,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:24:38,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:24:38,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:38,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:38,540 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 04:24:38,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 04:24:38,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:24:38,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:38,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:38,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:38,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-31 04:24:39,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-31 04:24:39,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-31 04:24:39,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:39,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:39,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:39,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-12-31 04:24:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:39,195 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:24:39,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:24:39,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 04:24:39,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 04:24:39,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 04:24:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:24:39,206 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2018-12-31 04:24:39,752 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-12-31 04:24:40,256 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-12-31 04:24:40,438 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-12-31 04:24:40,821 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-31 04:24:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:41,153 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-31 04:24:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 04:24:41,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-31 04:24:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:41,156 INFO L225 Difference]: With dead ends: 59 [2018-12-31 04:24:41,156 INFO L226 Difference]: Without dead ends: 54 [2018-12-31 04:24:41,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:24:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-31 04:24:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 25. [2018-12-31 04:24:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 04:24:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-31 04:24:41,175 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-12-31 04:24:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:41,176 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-31 04:24:41,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 04:24:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-31 04:24:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:24:41,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:41,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:41,179 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:41,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:41,180 INFO L82 PathProgramCache]: Analyzing trace with hash -108238562, now seen corresponding path program 1 times [2018-12-31 04:24:41,183 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:24:41,184 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:24:41,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:41,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:41,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:24:41,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:24:41,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:41,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:41,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:41,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-31 04:24:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:41,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:24:41,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:24:41,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 04:24:41,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 04:24:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 04:24:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:24:41,429 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 9 states. [2018-12-31 04:24:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:41,998 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-31 04:24:42,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:24:42,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-31 04:24:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:42,002 INFO L225 Difference]: With dead ends: 54 [2018-12-31 04:24:42,002 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 04:24:42,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:24:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 04:24:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2018-12-31 04:24:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 04:24:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-31 04:24:42,011 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-12-31 04:24:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:42,011 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-31 04:24:42,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 04:24:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-31 04:24:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:24:42,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:42,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:42,014 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash -501265572, now seen corresponding path program 1 times [2018-12-31 04:24:42,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:24:42,015 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:24:42,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:42,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:42,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:24:42,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:24:42,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:42,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:42,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:42,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-12-31 04:24:42,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-31 04:24:42,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-31 04:24:42,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:42,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:42,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:42,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-12-31 04:24:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:42,420 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:24:42,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:24:42,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 04:24:42,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 04:24:42,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 04:24:42,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:24:42,423 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-12-31 04:24:43,102 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-12-31 04:24:43,395 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-31 04:24:43,617 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-31 04:24:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:43,977 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-12-31 04:24:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 04:24:43,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-31 04:24:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:43,980 INFO L225 Difference]: With dead ends: 51 [2018-12-31 04:24:43,980 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 04:24:43,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-12-31 04:24:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 04:24:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 22. [2018-12-31 04:24:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 04:24:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-31 04:24:43,989 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2018-12-31 04:24:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:43,990 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-31 04:24:43,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 04:24:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-31 04:24:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 04:24:43,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:43,992 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:43,992 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:43,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1851619425, now seen corresponding path program 1 times [2018-12-31 04:24:43,993 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:24:43,993 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:24:44,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:44,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:44,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 04:24:44,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:24:44,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:44,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:44,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:44,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-31 04:24:44,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-31 04:24:44,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2018-12-31 04:24:44,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:44,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:44,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:44,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:16 [2018-12-31 04:24:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:44,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 04:24:44,932 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-12-31 04:24:44,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-31 04:24:44,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-12-31 04:24:44,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:44,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:44,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:24:44,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:7 [2018-12-31 04:24:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:45,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:24:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-12-31 04:24:45,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 04:24:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 04:24:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-12-31 04:24:45,225 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 21 states. [2018-12-31 04:24:45,954 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-12-31 04:24:46,509 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-12-31 04:24:46,695 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-31 04:24:47,005 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-31 04:24:47,470 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-12-31 04:24:47,649 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-31 04:24:47,901 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-31 04:24:48,255 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-31 04:24:48,439 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-12-31 04:24:48,884 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-12-31 04:24:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:49,262 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-12-31 04:24:49,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-31 04:24:49,264 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 18 [2018-12-31 04:24:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:49,265 INFO L225 Difference]: With dead ends: 65 [2018-12-31 04:24:49,265 INFO L226 Difference]: Without dead ends: 60 [2018-12-31 04:24:49,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2018-12-31 04:24:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-31 04:24:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 31. [2018-12-31 04:24:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 04:24:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-31 04:24:49,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 18 [2018-12-31 04:24:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:49,279 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-31 04:24:49,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 04:24:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-31 04:24:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 04:24:49,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:49,281 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:49,282 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash 200140454, now seen corresponding path program 1 times [2018-12-31 04:24:49,282 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:24:49,282 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:24:49,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:24:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:24:49,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:49,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:24:49,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:24:49,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:49,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:49,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:49,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-12-31 04:24:49,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-31 04:24:49,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-31 04:24:49,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:49,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:49,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:49,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-12-31 04:24:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:49,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 04:24:50,467 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-12-31 04:24:50,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-31 04:24:50,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-12-31 04:24:50,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:50,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:50,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:24:50,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:7 [2018-12-31 04:24:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:50,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:24:50,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-12-31 04:24:50,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 04:24:50,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 04:24:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-12-31 04:24:50,659 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 18 states. [2018-12-31 04:24:51,645 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-12-31 04:24:52,069 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-31 04:24:52,398 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-31 04:24:52,741 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-31 04:24:53,118 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-31 04:24:53,869 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-31 04:24:54,117 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-31 04:24:54,519 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2018-12-31 04:24:54,757 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-12-31 04:24:54,917 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-12-31 04:24:55,128 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2018-12-31 04:24:55,392 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2018-12-31 04:24:55,845 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-12-31 04:24:56,302 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-12-31 04:24:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:24:57,107 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-12-31 04:24:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-31 04:24:57,109 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2018-12-31 04:24:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:24:57,110 INFO L225 Difference]: With dead ends: 81 [2018-12-31 04:24:57,110 INFO L226 Difference]: Without dead ends: 76 [2018-12-31 04:24:57,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=728, Invalid=2578, Unknown=0, NotChecked=0, Total=3306 [2018-12-31 04:24:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-31 04:24:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 32. [2018-12-31 04:24:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 04:24:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-31 04:24:57,125 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2018-12-31 04:24:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:24:57,126 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-31 04:24:57,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 04:24:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-31 04:24:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 04:24:57,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:24:57,127 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:24:57,129 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:24:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:24:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash -597070086, now seen corresponding path program 2 times [2018-12-31 04:24:57,129 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:24:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:24:57,152 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-31 04:24:57,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:24:57,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:24:57,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:24:57,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 04:24:57,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:24:57,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:57,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:57,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:57,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-31 04:24:58,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-31 04:24:58,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-31 04:24:58,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:24:58,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:58,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:24:58,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-12-31 04:24:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:24:58,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 04:24:59,828 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2018-12-31 04:24:59,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-31 04:24:59,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-12-31 04:24:59,842 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:59,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:24:59,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:24:59,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:7 [2018-12-31 04:25:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:00,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:25:00,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-12-31 04:25:00,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-31 04:25:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-31 04:25:00,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2018-12-31 04:25:00,413 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 35 states. [2018-12-31 04:25:01,489 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-31 04:25:02,270 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-12-31 04:25:02,581 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-31 04:25:03,373 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2018-12-31 04:25:03,719 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-31 04:25:04,583 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-12-31 04:25:04,841 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-31 04:25:05,666 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2018-12-31 04:25:06,550 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-12-31 04:25:06,851 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-31 04:25:07,098 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-31 04:25:07,562 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-12-31 04:25:07,796 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-31 04:25:08,443 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2018-12-31 04:25:08,707 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-31 04:25:09,354 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-12-31 04:25:10,116 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-12-31 04:25:10,377 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-31 04:25:10,904 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-31 04:25:11,738 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-31 04:25:13,155 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-31 04:25:13,516 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-12-31 04:25:14,849 WARN L181 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-12-31 04:25:15,651 WARN L181 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-12-31 04:25:16,544 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2018-12-31 04:25:17,351 WARN L181 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-12-31 04:25:18,021 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-12-31 04:25:18,630 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-12-31 04:25:19,336 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-12-31 04:25:20,221 WARN L181 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-12-31 04:25:20,922 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-12-31 04:25:21,540 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-31 04:25:22,142 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-12-31 04:25:22,751 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-31 04:25:23,309 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-31 04:25:23,923 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-31 04:25:24,468 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-31 04:25:25,005 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-12-31 04:25:25,522 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2018-12-31 04:25:25,998 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2018-12-31 04:25:26,441 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-12-31 04:25:26,848 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-12-31 04:25:27,118 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2018-12-31 04:25:27,697 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2018-12-31 04:25:29,345 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-12-31 04:25:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:29,430 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-12-31 04:25:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-31 04:25:29,433 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 28 [2018-12-31 04:25:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:29,435 INFO L225 Difference]: With dead ends: 125 [2018-12-31 04:25:29,437 INFO L226 Difference]: Without dead ends: 120 [2018-12-31 04:25:29,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3429 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=2418, Invalid=9572, Unknown=0, NotChecked=0, Total=11990 [2018-12-31 04:25:29,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-31 04:25:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 59. [2018-12-31 04:25:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-31 04:25:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-12-31 04:25:29,483 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 28 [2018-12-31 04:25:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:29,484 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-12-31 04:25:29,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-31 04:25:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-12-31 04:25:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 04:25:29,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:29,486 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:29,486 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:29,486 INFO L82 PathProgramCache]: Analyzing trace with hash 745310975, now seen corresponding path program 2 times [2018-12-31 04:25:29,487 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:25:29,487 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:25:29,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:25:29,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:25:29,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:25:29,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:25:29,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 04:25:29,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-31 04:25:29,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:29,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:29,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:29,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-12-31 04:25:30,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-31 04:25:30,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-12-31 04:25:30,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:30,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:30,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:30,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:15 [2018-12-31 04:25:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:30,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 04:25:32,221 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-12-31 04:25:32,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-31 04:25:32,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-12-31 04:25:32,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:32,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:32,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:25:32,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:7 [2018-12-31 04:25:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:32,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:25:32,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-12-31 04:25:32,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-31 04:25:32,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-31 04:25:32,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-12-31 04:25:32,814 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 35 states. [2018-12-31 04:25:34,354 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-12-31 04:25:35,106 WARN L181 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-12-31 04:25:35,363 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-31 04:25:36,085 WARN L181 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-12-31 04:25:36,843 WARN L181 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-12-31 04:25:37,128 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-31 04:25:37,771 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-12-31 04:25:38,441 WARN L181 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-12-31 04:25:39,238 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2018-12-31 04:25:39,873 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-12-31 04:25:40,165 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-31 04:25:40,643 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-12-31 04:25:41,151 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2018-12-31 04:25:41,529 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-31 04:25:42,089 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2018-12-31 04:25:42,707 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2018-12-31 04:25:43,014 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-31 04:25:43,469 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-12-31 04:25:43,931 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2018-12-31 04:25:44,161 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-31 04:25:44,665 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-12-31 04:25:45,211 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-12-31 04:25:45,517 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-31 04:25:45,909 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2018-12-31 04:25:46,288 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-31 04:25:46,899 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-12-31 04:25:47,358 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-31 04:25:47,617 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-31 04:25:47,898 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-12-31 04:25:48,170 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-12-31 04:25:48,391 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-31 04:25:48,742 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-31 04:25:49,105 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-12-31 04:25:49,363 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-31 04:25:49,922 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-12-31 04:25:50,191 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-31 04:25:50,771 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-12-31 04:25:51,079 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-31 04:25:51,565 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-31 04:25:52,331 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-12-31 04:25:53,278 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-31 04:25:54,088 WARN L181 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-12-31 04:25:54,748 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-12-31 04:25:55,538 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-31 04:25:56,104 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-12-31 04:25:56,696 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-12-31 04:25:57,338 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2018-12-31 04:25:58,042 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2018-12-31 04:25:58,480 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2018-12-31 04:25:58,950 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2018-12-31 04:25:59,309 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-12-31 04:25:59,713 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-31 04:26:00,005 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-12-31 04:26:00,374 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-12-31 04:26:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:26:00,937 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2018-12-31 04:26:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-31 04:26:00,939 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 30 [2018-12-31 04:26:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:26:00,940 INFO L225 Difference]: With dead ends: 138 [2018-12-31 04:26:00,940 INFO L226 Difference]: Without dead ends: 133 [2018-12-31 04:26:00,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=2218, Invalid=8494, Unknown=0, NotChecked=0, Total=10712 [2018-12-31 04:26:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-31 04:26:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 77. [2018-12-31 04:26:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-31 04:26:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-12-31 04:26:00,983 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 30 [2018-12-31 04:26:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:26:00,983 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-12-31 04:26:00,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-31 04:26:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-12-31 04:26:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 04:26:00,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:26:00,985 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:26:00,985 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:26:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:26:00,986 INFO L82 PathProgramCache]: Analyzing trace with hash 415068814, now seen corresponding path program 3 times [2018-12-31 04:26:00,986 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 04:26:00,986 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 04:26:01,013 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-31 04:26:01,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 04:26:01,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:26:01,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:26:01,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:26:01,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:26:01,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:26:01,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:26:01,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:26:01,215 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 04:26:01,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-31 04:26:01,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:26:01,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:26:01,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:26:01,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:23 [2018-12-31 04:26:01,371 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-12-31 04:26:01,376 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 04:26:01,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-12-31 04:26:01,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-12-31 04:26:01,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:26:01,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:26:01,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-31 04:26:01,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:60, output treesize:34 [2018-12-31 04:26:07,522 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-31 04:26:11,601 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 04:26:15,666 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 04:26:19,746 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 04:26:23,832 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 04:26:27,977 WARN L181 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 04:26:32,079 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 04:26:32,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-31 04:26:32,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:26:32,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-31 04:26:32,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:67, output treesize:59 [2018-12-31 04:26:34,362 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-31 04:26:38,581 WARN L181 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-31 04:26:41,006 WARN L181 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 48 [2018-12-31 04:26:43,413 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-31 04:26:45,654 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-31 04:26:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 04:26:45,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 04:26:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 04:26:57,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:26:57,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-12-31 04:26:57,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-31 04:26:57,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-31 04:26:57,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=786, Unknown=3, NotChecked=0, Total=870 [2018-12-31 04:26:57,185 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 30 states. [2018-12-31 04:27:08,838 WARN L181 SmtUtils]: Spent 8.13 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-12-31 04:27:17,543 WARN L181 SmtUtils]: Spent 8.13 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-12-31 04:27:28,032 WARN L181 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-12-31 04:27:58,925 WARN L181 SmtUtils]: Spent 8.43 s on a formula simplification that was a NOOP. DAG size: 92 [2018-12-31 04:28:03,252 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-31 04:28:08,050 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_ULTIMATE.start_main_~i~0 (select (select |c_#memory_int| c_ULTIMATE.start_main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) c_ULTIMATE.start_main_~i~0) c_ULTIMATE.start_main_~pd2~0.offset (_ bv8 32))))) (.cse2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~pa~0.base) c_ULTIMATE.start_main_~pa~0.offset))) (and (= (_ bv0 32) c_ULTIMATE.start_main_~pd2~0.offset) (= c_ULTIMATE.start_main_~pa~0.base c_ULTIMATE.start_main_~pd2~0.base) (exists ((v_ULTIMATE.start_main_~i~0_56 (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet1_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet0_4| (_ BitVec 32))) (let ((.cse0 (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_56))) (and (bvsge v_ULTIMATE.start_main_~i~0_56 (_ bv0 32)) (bvslt v_ULTIMATE.start_main_~i~0_56 (_ bv10 32)) (= (bvadd c_ULTIMATE.start_main_~pa~0.offset (_ bv4294967288 32)) (bvadd .cse0 c_ULTIMATE.start_main_~pd2~0.offset)) (= (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) c_ULTIMATE.start_main_~pd2~0.offset |v_ULTIMATE.start_init_#t~nondet0_4|) (bvadd c_ULTIMATE.start_main_~pd2~0.offset (_ bv4 32)) |v_ULTIMATE.start_init_#t~nondet1_4|) (bvadd c_ULTIMATE.start_main_~pd2~0.offset .cse0 (_ bv8 32)) v_ULTIMATE.start_main_~i~0_56) (select |c_#memory_int| c_ULTIMATE.start_main_~pa~0.base))))) (or .cse1 (bvslt c_ULTIMATE.start_main_~i~0 |c_ULTIMATE.start_main_#t~mem11|)) (exists ((|~#d2~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet3_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet2_4| (_ BitVec 32))) (and (= (select |c_#memory_int| |~#d2~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (_ bv0 32) |v_ULTIMATE.start_init_#t~nondet2_4|) (_ bv4 32) |v_ULTIMATE.start_init_#t~nondet3_4|)) (not (= c_ULTIMATE.start_main_~pd2~0.base |~#d2~0.base|)))) (or (bvslt c_ULTIMATE.start_main_~i~0 .cse2) .cse1) (= |c_ULTIMATE.start_main_#t~mem11| .cse2) (forall ((ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_ULTIMATE.start_main_~i~0_58 (_ BitVec 32))) (let ((.cse5 (bvmul (_ bv4 32) ULTIMATE.start_main_~i~0))) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_get_dummy_#res.base|) (bvadd |c_ULTIMATE.start_get_dummy_#res.offset| .cse5 (_ bv8 32)) ULTIMATE.start_main_~i~0))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_get_dummy_#res.base| .cse4) c_ULTIMATE.start_main_~pd1~0.base) (bvadd .cse5 c_ULTIMATE.start_main_~pd1~0.offset (_ bv8 32))))) (or (not (bvsge ULTIMATE.start_main_~i~0 (_ bv0 32))) (not (bvslt (bvadd v_ULTIMATE.start_main_~i~0_58 (_ bv4294967295 32)) .cse3)) (not (bvslt ULTIMATE.start_main_~i~0 (_ bv10 32))) (= (select .cse4 (bvadd |c_ULTIMATE.start_get_dummy_#res.offset| (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_58) (_ bv8 32))) v_ULTIMATE.start_main_~i~0_58) (bvslt v_ULTIMATE.start_main_~i~0_58 .cse3)))))) (forall ((ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_ULTIMATE.start_main_~i~0_58 (_ BitVec 32))) (let ((.cse8 (bvmul (_ bv4 32) ULTIMATE.start_main_~i~0))) (let ((.cse7 (store (select |c_#memory_int| c_ULTIMATE.start_main_~pd2~0.base) (bvadd c_ULTIMATE.start_main_~pd2~0.offset .cse8 (_ bv8 32)) ULTIMATE.start_main_~i~0))) (let ((.cse6 (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~pd2~0.base .cse7) c_ULTIMATE.start_main_~pd1~0.base) (bvadd .cse8 c_ULTIMATE.start_main_~pd1~0.offset (_ bv8 32))))) (or (not (bvsge ULTIMATE.start_main_~i~0 (_ bv0 32))) (not (bvslt (bvadd v_ULTIMATE.start_main_~i~0_58 (_ bv4294967295 32)) .cse6)) (= (select .cse7 (bvadd c_ULTIMATE.start_main_~pd2~0.offset (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_58) (_ bv8 32))) v_ULTIMATE.start_main_~i~0_58) (not (bvslt ULTIMATE.start_main_~i~0 (_ bv10 32))) (bvslt v_ULTIMATE.start_main_~i~0_58 .cse6)))))))) is different from false [2018-12-31 04:28:31,400 WARN L181 SmtUtils]: Spent 12.20 s on a formula simplification that was a NOOP. DAG size: 58 [2018-12-31 04:28:40,883 WARN L181 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-12-31 04:28:55,681 WARN L181 SmtUtils]: Spent 8.39 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-31 04:29:01,342 WARN L181 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-31 04:29:08,971 WARN L181 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-12-31 04:29:16,784 WARN L181 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-12-31 04:29:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:29:17,247 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-12-31 04:29:17,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 04:29:17,247 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2018-12-31 04:29:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:29:17,248 INFO L225 Difference]: With dead ends: 113 [2018-12-31 04:29:17,248 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:29:17,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 172.8s TimeCoverageRelationStatistics Valid=235, Invalid=1735, Unknown=14, NotChecked=86, Total=2070 [2018-12-31 04:29:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:29:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:29:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:29:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:29:17,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-12-31 04:29:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:29:17,251 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:29:17,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-31 04:29:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:29:17,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:29:17,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:29:17,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:17,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:17,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:17,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:17,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:17,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:17,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:18,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:18,262 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 474 DAG size of output: 402 [2018-12-31 04:29:18,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:29:31,036 WARN L181 SmtUtils]: Spent 12.69 s on a formula simplification. DAG size of input: 385 DAG size of output: 45 [2018-12-31 04:29:43,530 WARN L181 SmtUtils]: Spent 12.49 s on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2018-12-31 04:29:44,091 WARN L181 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 47 [2018-12-31 04:30:08,472 WARN L181 SmtUtils]: Spent 24.38 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-31 04:30:08,474 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-12-31 04:30:08,474 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-12-31 04:30:08,474 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 21 24) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |~#d2~0.offset|)) (.cse1 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse2 (exists ((|~#d2~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet3_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet2_4| (_ BitVec 32))) (and (= (select |#memory_int| |~#d2~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (_ bv0 32) |v_ULTIMATE.start_init_#t~nondet2_4|) (_ bv4 32) |v_ULTIMATE.start_init_#t~nondet3_4|)) (not (= |~#d1~0.base| |~#d2~0.base|))))) (.cse3 (= (_ bv0 32) |~#d1~0.offset|)) (.cse4 (exists ((|v_ULTIMATE.start_init_#t~nondet1_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet0_4| (_ BitVec 32))) (= (select |#memory_int| |~#d1~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) |~#d1~0.offset| |v_ULTIMATE.start_init_#t~nondet0_4|) (bvadd |~#d1~0.offset| (_ bv4 32)) |v_ULTIMATE.start_init_#t~nondet1_4|))))) (or (and (= |ULTIMATE.start_get_dummy_#res.base| |~#d1~0.base|) (= |ULTIMATE.start_get_dummy_#res.offset| |~#d1~0.offset|) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_get_dummy_#res.offset| |~#d2~0.offset|) .cse0 .cse1 (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) .cse2 .cse3 .cse4))) [2018-12-31 04:30:08,474 INFO L448 ceAbstractionStarter]: For program point L23-4(line 23) no Hoare annotation was computed. [2018-12-31 04:30:08,475 INFO L448 ceAbstractionStarter]: For program point L23-6(line 23) no Hoare annotation was computed. [2018-12-31 04:30:08,475 INFO L444 ceAbstractionStarter]: At program point L23-7(lines 21 24) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (let ((.cse3 (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) (.cse1 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse2 (not .cse0)) (.cse4 (= (_ bv0 32) |~#d1~0.offset|))) (or (and (and (or (and (and .cse0 (= ULTIMATE.start_main_~pd1~0.offset |~#d1~0.offset|)) .cse1) (and (= |ULTIMATE.start_get_dummy_#res.offset| |~#d2~0.offset|) (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) .cse2 (= ULTIMATE.start_main_~pd1~0.offset |ULTIMATE.start_get_dummy_#res.offset|) .cse3)) .cse4) (= (_ bv0 32) |~#d2~0.offset|) (exists ((|~#d2~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet3_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet2_4| (_ BitVec 32))) (and (= (select |#memory_int| |~#d2~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (_ bv0 32) |v_ULTIMATE.start_init_#t~nondet2_4|) (_ bv4 32) |v_ULTIMATE.start_init_#t~nondet3_4|)) (not (= |~#d1~0.base| |~#d2~0.base|)))) (exists ((|v_ULTIMATE.start_init_#t~nondet1_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet0_4| (_ BitVec 32))) (= (select |#memory_int| |~#d1~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) |~#d1~0.offset| |v_ULTIMATE.start_init_#t~nondet0_4|) (bvadd |~#d1~0.offset| (_ bv4 32)) |v_ULTIMATE.start_init_#t~nondet1_4|)))) (and (not .cse3) .cse1 .cse2 .cse4)))) [2018-12-31 04:30:08,475 INFO L444 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: false [2018-12-31 04:30:08,475 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-12-31 04:30:08,475 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (and (forall ((v_ULTIMATE.start_main_~i~0_58 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (bvadd ULTIMATE.start_main_~pd2~0.offset (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_58) (_ bv8 32))) v_ULTIMATE.start_main_~i~0_58) (bvslt v_ULTIMATE.start_main_~i~0_58 .cse0) (not (bvslt (bvadd v_ULTIMATE.start_main_~i~0_58 (_ bv4294967295 32)) .cse0))))) (or (bvslt ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~pd2~0.offset (_ bv8 32))))) (= (_ bv0 32) |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base) (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (= (_ bv0 32) |~#d1~0.offset|)) [2018-12-31 04:30:08,475 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2018-12-31 04:30:08,475 INFO L448 ceAbstractionStarter]: For program point L40-4(lines 40 42) no Hoare annotation was computed. [2018-12-31 04:30:08,475 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2018-12-31 04:30:08,476 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:30:08,476 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:30:08,476 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:30:08,476 INFO L444 ceAbstractionStarter]: At program point L28(lines 26 29) the Hoare annotation is: (and (= (_ bv1 32) |ULTIMATE.start_check_#res|) (forall ((v_ULTIMATE.start_main_~i~0_58 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (bvadd ULTIMATE.start_main_~pd2~0.offset (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_58) (_ bv8 32))) v_ULTIMATE.start_main_~i~0_58) (bvslt v_ULTIMATE.start_main_~i~0_58 .cse0) (not (bvslt (bvadd v_ULTIMATE.start_main_~i~0_58 (_ bv4294967295 32)) .cse0))))) (= ULTIMATE.start_main_~pd1~0.offset ULTIMATE.start_main_~pd2~0.offset) (not (= |~#d1~0.base| |~#d2~0.base|)) (= (_ bv0 32) |~#d2~0.offset|) (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base) (= (_ bv0 32) |~#d1~0.offset|) (= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~pd2~0.offset (_ bv8 32))))) [2018-12-31 04:30:08,476 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-12-31 04:30:08,476 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:30:08,476 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2018-12-31 04:30:08,476 INFO L451 ceAbstractionStarter]: At program point L51(lines 31 52) the Hoare annotation is: true [2018-12-31 04:30:08,476 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 45) no Hoare annotation was computed. [2018-12-31 04:30:08,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,507 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,509 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-31 04:30:08,518 INFO L168 Benchmark]: Toolchain (without parser) took 331886.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 333.4 MB). Free memory was 951.3 MB in the beginning and 801.1 MB in the end (delta: 150.2 MB). Peak memory consumption was 513.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:30:08,518 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:30:08,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:30:08,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.03 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:30:08,519 INFO L168 Benchmark]: Boogie Preprocessor took 114.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:30:08,520 INFO L168 Benchmark]: RCFGBuilder took 528.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:30:08,520 INFO L168 Benchmark]: TraceAbstraction took 330759.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 801.1 MB in the end (delta: 286.6 MB). Peak memory consumption was 524.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:30:08,526 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 417.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 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 59.03 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 528.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 330759.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 801.1 MB in the end (delta: 286.6 MB). Peak memory consumption was 524.7 MB. 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_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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: 40]: Loop Invariant [2018-12-31 04:30:08,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#d2~0.base,QUANTIFIED] [2018-12-31 04:30:08,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2018-12-31 04:30:08,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#d2~0.base,QUANTIFIED] [2018-12-31 04:30:08,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:30:08,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((forall v_ULTIMATE.start_main_~i~0_58 : bv32 :: (unknown-#memory_int-unknown[pd2][~bvadd64(pd2, ~bvmul32(4bv32, v_ULTIMATE.start_main_~i~0_58), 8bv32)] == v_ULTIMATE.start_main_~i~0_58 || ~bvslt32(v_ULTIMATE.start_main_~i~0_58, unknown-#memory_int-unknown[pa][pa])) || !~bvslt32(~bvadd64(v_ULTIMATE.start_main_~i~0_58, 4294967295bv32), unknown-#memory_int-unknown[pa][pa])) && (~bvslt32(i, unknown-#memory_int-unknown[pa][pa]) || i == unknown-#memory_int-unknown[pd2][~bvadd64(~bvmul32(4bv32, i), pd2, 8bv32)])) && 0bv32 == d2) && !(d1 == ~#d2~0.base)) && pd1 == pd2) && pd2 == pd1) && 0bv32 == d1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...