./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/eqn1f.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3c39aff9 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/eqn1f.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 b294b69c7e36d528e963d4d19e42533f57ed2d99 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/eqn1f.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 b294b69c7e36d528e963d4d19e42533f57ed2d99 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-3c39aff [2019-11-27 18:43:38,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:43:38,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:43:38,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:43:38,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:43:38,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:43:38,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:43:38,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:43:38,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:43:38,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:43:38,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:43:38,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:43:38,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:43:38,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:43:38,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:43:38,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:43:38,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:43:38,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:43:38,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:43:38,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:43:38,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:43:38,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:43:38,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:43:38,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:43:38,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:43:38,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:43:38,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:43:38,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:43:38,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:43:38,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:43:38,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:43:38,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:43:38,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:43:38,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:43:38,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:43:38,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:43:38,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:43:38,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:43:38,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:43:38,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:43:38,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:43:38,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 18:43:38,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:43:38,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:43:38,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:43:38,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:43:38,114 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:43:38,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:43:38,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:43:38,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:43:38,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:43:38,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:43:38,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 18:43:38,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:43:38,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 18:43:38,117 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:43:38,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 18:43:38,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:43:38,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 18:43:38,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:43:38,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:43:38,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:43:38,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:43:38,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:43:38,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:43:38,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:43:38,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 18:43:38,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 18:43:38,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 18:43:38,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 18:43:38,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b294b69c7e36d528e963d4d19e42533f57ed2d99 [2019-11-27 18:43:38,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:43:38,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:43:38,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:43:38,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:43:38,491 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:43:38,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/eqn1f.c [2019-11-27 18:43:38,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d2c0571/1da4072d43984b5f9f17ca384777e84b/FLAGcfd31a5d2 [2019-11-27 18:43:39,038 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:43:39,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn1f.c [2019-11-27 18:43:39,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d2c0571/1da4072d43984b5f9f17ca384777e84b/FLAGcfd31a5d2 [2019-11-27 18:43:39,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d2c0571/1da4072d43984b5f9f17ca384777e84b [2019-11-27 18:43:39,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:43:39,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 18:43:39,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:43:39,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:43:39,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:43:39,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab7d03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39, skipping insertion in model container [2019-11-27 18:43:39,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:43:39,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:43:39,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:43:39,665 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:43:39,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:43:39,706 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:43:39,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39 WrapperNode [2019-11-27 18:43:39,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:43:39,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 18:43:39,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 18:43:39,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 18:43:39,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 18:43:39,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:43:39,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:43:39,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:43:39,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:43:39,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:43:39,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:43:39,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:43:39,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:43:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 18:43:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:43:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:43:39,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:43:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 18:43:40,215 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:43:40,215 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-27 18:43:40,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:43:40 BoogieIcfgContainer [2019-11-27 18:43:40,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:43:40,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:43:40,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:43:40,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:43:40,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:43:39" (1/3) ... [2019-11-27 18:43:40,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f98d96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:43:40, skipping insertion in model container [2019-11-27 18:43:40,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (2/3) ... [2019-11-27 18:43:40,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f98d96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:43:40, skipping insertion in model container [2019-11-27 18:43:40,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:43:40" (3/3) ... [2019-11-27 18:43:40,227 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn1f.c [2019-11-27 18:43:40,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:43:40,247 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 18:43:40,265 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 18:43:40,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:43:40,301 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 18:43:40,302 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:43:40,303 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:43:40,303 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:43:40,303 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:43:40,304 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:43:40,304 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:43:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-27 18:43:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 18:43:40,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:40,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:40,336 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-27 18:43:40,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:40,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533067036] [2019-11-27 18:43:40,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:40,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533067036] [2019-11-27 18:43:40,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:43:40,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 18:43:40,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300193971] [2019-11-27 18:43:40,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 18:43:40,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:40,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 18:43:40,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 18:43:40,514 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-27 18:43:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:40,528 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-27 18:43:40,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 18:43:40,530 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 18:43:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:40,540 INFO L225 Difference]: With dead ends: 33 [2019-11-27 18:43:40,540 INFO L226 Difference]: Without dead ends: 15 [2019-11-27 18:43:40,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 18:43:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-27 18:43:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-27 18:43:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-27 18:43:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-27 18:43:40,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-27 18:43:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:40,577 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-27 18:43:40,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 18:43:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-27 18:43:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 18:43:40,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:40,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:40,579 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-27 18:43:40,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:40,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069701235] [2019-11-27 18:43:40,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:40,601 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:40,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779469594] [2019-11-27 18:43:40,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:40,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:43:40,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:40,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:40,770 INFO L377 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-27 18:43:40,771 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:40,809 INFO L588 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-27 18:43:40,813 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:43:40,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-27 18:43:40,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:40,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069701235] [2019-11-27 18:43:40,871 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:40,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779469594] [2019-11-27 18:43:40,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:43:40,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:43:40,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560033884] [2019-11-27 18:43:40,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:43:40,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:43:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:43:40,877 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-11-27 18:43:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:40,983 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-11-27 18:43:40,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:43:40,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-27 18:43:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:40,985 INFO L225 Difference]: With dead ends: 32 [2019-11-27 18:43:40,985 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 18:43:40,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:43:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 18:43:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-11-27 18:43:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 18:43:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-27 18:43:40,995 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2019-11-27 18:43:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:40,996 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-27 18:43:40,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:43:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-27 18:43:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 18:43:40,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:40,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:41,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:41,204 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash 130601367, now seen corresponding path program 1 times [2019-11-27 18:43:41,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:41,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303371425] [2019-11-27 18:43:41,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:41,243 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:41,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44426179] [2019-11-27 18:43:41,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:41,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 18:43:41,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:41,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303371425] [2019-11-27 18:43:41,320 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:41,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44426179] [2019-11-27 18:43:41,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:43:41,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:43:41,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880242346] [2019-11-27 18:43:41,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:43:41,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:41,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:43:41,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:43:41,323 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-11-27 18:43:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:41,441 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-11-27 18:43:41,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:43:41,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-27 18:43:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:41,443 INFO L225 Difference]: With dead ends: 47 [2019-11-27 18:43:41,443 INFO L226 Difference]: Without dead ends: 38 [2019-11-27 18:43:41,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:43:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-27 18:43:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2019-11-27 18:43:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 18:43:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-27 18:43:41,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-27 18:43:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:41,458 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-27 18:43:41,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:43:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-27 18:43:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 18:43:41,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:41,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:41,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:41,672 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash 827904471, now seen corresponding path program 1 times [2019-11-27 18:43:41,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:41,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463948913] [2019-11-27 18:43:41,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:41,691 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:41,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56568795] [2019-11-27 18:43:41,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:41,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 18:43:41,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:41,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463948913] [2019-11-27 18:43:41,775 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:41,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56568795] [2019-11-27 18:43:41,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 18:43:41,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-27 18:43:41,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172691794] [2019-11-27 18:43:41,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:43:41,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:41,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:43:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:43:41,780 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-27 18:43:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:41,870 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-27 18:43:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:43:41,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-27 18:43:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:41,871 INFO L225 Difference]: With dead ends: 42 [2019-11-27 18:43:41,872 INFO L226 Difference]: Without dead ends: 35 [2019-11-27 18:43:41,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:43:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-27 18:43:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-11-27 18:43:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 18:43:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-27 18:43:41,879 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2019-11-27 18:43:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:41,880 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-27 18:43:41,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:43:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-27 18:43:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 18:43:41,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:41,881 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:42,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:42,084 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-27 18:43:42,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:42,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666250069] [2019-11-27 18:43:42,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:42,098 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:42,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933587157] [2019-11-27 18:43:42,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:42,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:43:42,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:42,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666250069] [2019-11-27 18:43:42,202 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:42,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933587157] [2019-11-27 18:43:42,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:43:42,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 18:43:42,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067783795] [2019-11-27 18:43:42,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 18:43:42,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:42,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 18:43:42,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 18:43:42,206 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-11-27 18:43:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:42,368 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-27 18:43:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 18:43:42,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-27 18:43:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:42,375 INFO L225 Difference]: With dead ends: 39 [2019-11-27 18:43:42,375 INFO L226 Difference]: Without dead ends: 25 [2019-11-27 18:43:42,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-27 18:43:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-27 18:43:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-27 18:43:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-27 18:43:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-27 18:43:42,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2019-11-27 18:43:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:42,385 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-27 18:43:42,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 18:43:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-27 18:43:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 18:43:42,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:42,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:42,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:42,593 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1602337035, now seen corresponding path program 1 times [2019-11-27 18:43:42,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:42,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934728279] [2019-11-27 18:43:42,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:42,629 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:42,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588977240] [2019-11-27 18:43:42,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:42,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 18:43:42,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:42,712 INFO L377 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 10 treesize of output 8 [2019-11-27 18:43:42,713 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:42,722 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:42,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-27 18:43:42,729 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:42,736 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:42,736 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:43:42,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2019-11-27 18:43:42,799 INFO L343 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2019-11-27 18:43:42,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2019-11-27 18:43:42,801 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:42,831 INFO L588 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-27 18:43:42,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:42,835 INFO L508 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. [2019-11-27 18:43:42,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2019-11-27 18:43:42,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:42,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:42,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:42,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:42,978 INFO L404 ElimStorePlain]: Different costs {12=[v_prenex_4], 20=[|v_#memory_int_12|]} [2019-11-27 18:43:42,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:42,988 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-27 18:43:42,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2019-11-27 18:43:42,989 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:43,023 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:43,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:43,067 INFO L343 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2019-11-27 18:43:43,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2019-11-27 18:43:43,071 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:43,134 INFO L588 ElimStorePlain]: treesize reduction 50, result has 66.4 percent of original size [2019-11-27 18:43:43,136 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-27 18:43:43,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:99 [2019-11-27 18:43:43,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:43,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934728279] [2019-11-27 18:43:43,300 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:43,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588977240] [2019-11-27 18:43:43,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 18:43:43,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-27 18:43:43,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935016266] [2019-11-27 18:43:43,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:43:43,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:43,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:43:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:43:43,303 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2019-11-27 18:43:43,557 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-11-27 18:43:43,884 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-11-27 18:43:44,073 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-11-27 18:43:44,262 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-27 18:43:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:44,310 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-27 18:43:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:43:44,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-27 18:43:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:44,314 INFO L225 Difference]: With dead ends: 42 [2019-11-27 18:43:44,314 INFO L226 Difference]: Without dead ends: 40 [2019-11-27 18:43:44,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-27 18:43:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-27 18:43:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2019-11-27 18:43:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 18:43:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-27 18:43:44,323 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2019-11-27 18:43:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:44,323 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-27 18:43:44,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:43:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-27 18:43:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 18:43:44,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:44,325 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:44,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:44,529 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash -602215277, now seen corresponding path program 2 times [2019-11-27 18:43:44,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:44,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425029826] [2019-11-27 18:43:44,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:44,556 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:44,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502971397] [2019-11-27 18:43:44,557 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:44,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 18:43:44,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:43:44,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 18:43:44,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:44,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425029826] [2019-11-27 18:43:44,652 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:44,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502971397] [2019-11-27 18:43:44,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 18:43:44,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-27 18:43:44,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111789675] [2019-11-27 18:43:44,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 18:43:44,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:44,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 18:43:44,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:43:44,655 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2019-11-27 18:43:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:44,798 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-27 18:43:44,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:43:44,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-27 18:43:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:44,803 INFO L225 Difference]: With dead ends: 59 [2019-11-27 18:43:44,803 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 18:43:44,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:43:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 18:43:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2019-11-27 18:43:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 18:43:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-11-27 18:43:44,816 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2019-11-27 18:43:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:44,817 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-27 18:43:44,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 18:43:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-11-27 18:43:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 18:43:44,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:44,819 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:45,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:45,020 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash -508830509, now seen corresponding path program 3 times [2019-11-27 18:43:45,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:45,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073651891] [2019-11-27 18:43:45,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:45,048 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:45,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548062910] [2019-11-27 18:43:45,053 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:45,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 18:43:45,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:43:45,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 18:43:45,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:45,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073651891] [2019-11-27 18:43:45,143 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:45,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548062910] [2019-11-27 18:43:45,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 18:43:45,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-27 18:43:45,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563790897] [2019-11-27 18:43:45,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 18:43:45,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 18:43:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:43:45,144 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-11-27 18:43:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:45,269 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-27 18:43:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:43:45,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-27 18:43:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:45,270 INFO L225 Difference]: With dead ends: 54 [2019-11-27 18:43:45,270 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 18:43:45,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:43:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 18:43:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-27 18:43:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 18:43:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-27 18:43:45,277 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2019-11-27 18:43:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:45,278 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-27 18:43:45,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 18:43:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-27 18:43:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 18:43:45,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:45,279 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:45,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:45,484 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:45,484 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-27 18:43:45,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:45,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784685904] [2019-11-27 18:43:45,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:45,496 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:45,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796106271] [2019-11-27 18:43:45,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:45,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-27 18:43:45,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:45,573 INFO L377 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 10 treesize of output 8 [2019-11-27 18:43:45,574 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:45,587 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:45,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-27 18:43:45,597 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:45,605 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:45,605 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:43:45,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2019-11-27 18:43:45,628 INFO L343 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2019-11-27 18:43:45,629 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 32 [2019-11-27 18:43:45,630 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:45,639 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:45,639 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:43:45,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-27 18:43:45,680 INFO L343 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-27 18:43:45,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 46 [2019-11-27 18:43:45,682 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:45,694 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:45,695 INFO L508 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. [2019-11-27 18:43:45,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2019-11-27 18:43:45,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:45,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784685904] [2019-11-27 18:43:45,921 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:45,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796106271] [2019-11-27 18:43:45,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 18:43:45,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-27 18:43:45,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320181908] [2019-11-27 18:43:45,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:43:45,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:43:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:43:45,928 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2019-11-27 18:43:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:46,335 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-27 18:43:46,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 18:43:46,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-27 18:43:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:46,337 INFO L225 Difference]: With dead ends: 43 [2019-11-27 18:43:46,338 INFO L226 Difference]: Without dead ends: 41 [2019-11-27 18:43:46,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-27 18:43:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-27 18:43:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-11-27 18:43:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 18:43:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-27 18:43:46,353 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-11-27 18:43:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:46,354 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-27 18:43:46,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:43:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-27 18:43:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 18:43:46,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:46,356 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:46,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:46,561 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2009431311, now seen corresponding path program 4 times [2019-11-27 18:43:46,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:46,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789217885] [2019-11-27 18:43:46,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:46,576 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:46,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076859834] [2019-11-27 18:43:46,577 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:46,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 18:43:46,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 18:43:46,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-27 18:43:46,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:46,630 INFO L377 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 10 treesize of output 8 [2019-11-27 18:43:46,631 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:46,643 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:46,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-27 18:43:46,648 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:46,656 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:46,656 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:43:46,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2019-11-27 18:43:46,715 INFO L343 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2019-11-27 18:43:46,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2019-11-27 18:43:46,719 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:46,751 INFO L588 ElimStorePlain]: treesize reduction 24, result has 68.4 percent of original size [2019-11-27 18:43:46,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:46,753 INFO L508 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. [2019-11-27 18:43:46,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:52 [2019-11-27 18:43:46,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:46,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:46,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:46,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:46,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:46,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 143 [2019-11-27 18:43:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:46,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:46,883 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:46,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:47,054 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-27 18:43:47,055 INFO L343 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2019-11-27 18:43:47,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2019-11-27 18:43:47,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,064 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:47,340 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 47 [2019-11-27 18:43:47,341 INFO L588 ElimStorePlain]: treesize reduction 807, result has 15.0 percent of original size [2019-11-27 18:43:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,345 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-27 18:43:47,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:142 [2019-11-27 18:43:47,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:47,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:44:45,808 WARN L192 SmtUtils]: Spent 56.26 s on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-11-27 18:44:45,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 18:44:45,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:44:45,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:44:45,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:44:45,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:44:45,851 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2019-11-27 18:44:45,861 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:44:45,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:44:45,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:44:45,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2019-11-27 18:44:45,904 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:44:45,912 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,913 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:44:45,915 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,951 INFO L343 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2019-11-27 18:44:45,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 107 [2019-11-27 18:44:45,954 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 18:44:45,963 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,988 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:44:45,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:44:46,015 INFO L343 Elim1Store]: treesize reduction 18, result has 67.3 percent of original size [2019-11-27 18:44:46,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 109 [2019-11-27 18:44:46,017 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 18:44:46,259 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-11-27 18:44:46,260 INFO L588 ElimStorePlain]: treesize reduction 129, result has 69.6 percent of original size [2019-11-27 18:44:46,261 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-11-27 18:44:46,261 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:304, output treesize:295 [2019-11-27 18:45:20,457 WARN L192 SmtUtils]: Spent 32.16 s on a formula simplification that was a NOOP. DAG size: 67 [2019-11-27 18:45:20,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 18:45:54,627 WARN L192 SmtUtils]: Spent 32.13 s on a formula simplification that was a NOOP. DAG size: 64 [2019-11-27 18:45:54,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 18:45:54,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:45:54,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 98 [2019-11-27 18:45:54,738 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:45:54,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,886 INFO L343 Elim1Store]: treesize reduction 18, result has 81.3 percent of original size [2019-11-27 18:45:54,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 178 [2019-11-27 18:45:54,890 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:45:54,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:54,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,022 INFO L343 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2019-11-27 18:45:55,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 175 [2019-11-27 18:45:55,025 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 18:45:55,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:45:55,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:45:55,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 107 [2019-11-27 18:45:55,084 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 18:45:55,400 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2019-11-27 18:45:55,401 INFO L588 ElimStorePlain]: treesize reduction 392, result has 47.6 percent of original size [2019-11-27 18:45:55,404 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-11-27 18:45:55,405 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:370, output treesize:356 [2019-11-27 18:45:59,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:45:59,322 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:133) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) 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:120) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-11-27 18:45:59,329 INFO L168 Benchmark]: Toolchain (without parser) took 139907.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.4 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -221.1 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-11-27 18:45:59,329 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:45:59,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 18:45:59,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-27 18:45:59,331 INFO L168 Benchmark]: Boogie Preprocessor took 46.19 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 18:45:59,332 INFO L168 Benchmark]: RCFGBuilder took 357.38 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-27 18:45:59,332 INFO L168 Benchmark]: TraceAbstraction took 139109.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.3 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-11-27 18:45:59,336 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 105.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.19 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 357.38 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 139109.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.3 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-3c39aff [2019-11-27 18:46:01,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:46:01,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:46:01,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:46:01,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:46:01,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:46:01,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:46:01,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:46:01,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:46:01,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:46:01,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:46:01,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:46:01,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:46:01,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:46:01,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:46:01,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:46:01,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:46:01,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:46:01,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:46:01,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:46:01,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:46:01,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:46:01,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:46:01,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:46:01,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:46:01,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:46:01,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:46:01,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:46:01,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:46:01,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:46:01,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:46:01,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:46:01,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:46:01,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:46:01,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:46:01,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:46:01,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:46:01,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:46:01,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:46:01,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:46:01,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:46:01,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 18:46:01,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:46:01,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:46:01,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:46:01,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:46:01,253 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:46:01,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:46:01,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:46:01,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:46:01,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:46:01,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 18:46:01,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:46:01,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 18:46:01,255 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 18:46:01,255 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 18:46:01,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:46:01,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 18:46:01,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:46:01,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 18:46:01,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:46:01,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:46:01,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:46:01,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:46:01,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:46:01,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:46:01,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:46:01,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 18:46:01,259 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 18:46:01,259 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 18:46:01,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 18:46:01,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 18:46:01,260 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b294b69c7e36d528e963d4d19e42533f57ed2d99 [2019-11-27 18:46:01,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:46:01,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:46:01,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:46:01,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:46:01,629 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:46:01,630 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/eqn1f.c [2019-11-27 18:46:01,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce19580ef/2cf7b220fc4d4d67acc67c069c97eaaf/FLAG698022cd6 [2019-11-27 18:46:02,146 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:46:02,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn1f.c [2019-11-27 18:46:02,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce19580ef/2cf7b220fc4d4d67acc67c069c97eaaf/FLAG698022cd6 [2019-11-27 18:46:02,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce19580ef/2cf7b220fc4d4d67acc67c069c97eaaf [2019-11-27 18:46:02,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:46:02,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 18:46:02,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:46:02,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:46:02,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:46:02,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:02,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fcca56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02, skipping insertion in model container [2019-11-27 18:46:02,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:02,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:46:02,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:46:02,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:46:02,847 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:46:02,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:46:02,949 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:46:02,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02 WrapperNode [2019-11-27 18:46:02,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:46:02,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 18:46:02,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 18:46:02,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 18:46:02,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:02,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:02,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 18:46:02,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:46:02,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:46:02,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:46:03,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:03,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:03,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:03,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:03,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:03,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:03,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... [2019-11-27 18:46:03,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:46:03,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:46:03,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:46:03,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:46:03,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:46:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-27 18:46:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:46:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:46:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:46:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-27 18:46:03,444 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:46:03,444 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-27 18:46:03,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:46:03 BoogieIcfgContainer [2019-11-27 18:46:03,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:46:03,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:46:03,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:46:03,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:46:03,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:46:02" (1/3) ... [2019-11-27 18:46:03,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103750f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:46:03, skipping insertion in model container [2019-11-27 18:46:03,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:02" (2/3) ... [2019-11-27 18:46:03,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103750f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:46:03, skipping insertion in model container [2019-11-27 18:46:03,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:46:03" (3/3) ... [2019-11-27 18:46:03,462 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn1f.c [2019-11-27 18:46:03,472 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:46:03,479 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 18:46:03,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 18:46:03,515 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:46:03,515 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 18:46:03,515 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:46:03,515 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:46:03,516 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:46:03,516 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:46:03,516 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:46:03,516 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:46:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-27 18:46:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 18:46:03,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:03,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:46:03,540 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:46:03,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:03,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-27 18:46:03,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:46:03,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109621387] [2019-11-27 18:46:03,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 18:46:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:03,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 18:46:03,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:46:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:03,687 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:46:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:03,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109621387] [2019-11-27 18:46:03,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:03,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 18:46:03,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868398043] [2019-11-27 18:46:03,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 18:46:03,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:46:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 18:46:03,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 18:46:03,715 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-27 18:46:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:03,732 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-27 18:46:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 18:46:03,734 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 18:46:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:03,743 INFO L225 Difference]: With dead ends: 33 [2019-11-27 18:46:03,743 INFO L226 Difference]: Without dead ends: 15 [2019-11-27 18:46:03,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 18:46:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-27 18:46:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-27 18:46:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-27 18:46:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-27 18:46:03,777 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-27 18:46:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:03,777 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-27 18:46:03,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 18:46:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-27 18:46:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 18:46:03,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:03,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:46:03,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 18:46:03,980 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:46:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:03,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-27 18:46:03,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:46:03,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092401045] [2019-11-27 18:46:03,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 18:46:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:04,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:46:04,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:46:04,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:46:04,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:04,161 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:46:04,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:04,199 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-27 18:46:04,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 39 [2019-11-27 18:46:04,201 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:46:04,232 INFO L588 ElimStorePlain]: treesize reduction 9, result has 78.6 percent of original size [2019-11-27 18:46:04,234 INFO L508 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. [2019-11-27 18:46:04,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:33 [2019-11-27 18:46:04,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:46:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:04,345 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:46:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:04,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092401045] [2019-11-27 18:46:04,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:04,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-27 18:46:04,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430275713] [2019-11-27 18:46:04,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:46:04,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:46:04,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:46:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:46:04,585 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2019-11-27 18:46:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:05,123 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-27 18:46:05,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:46:05,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-27 18:46:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:05,127 INFO L225 Difference]: With dead ends: 22 [2019-11-27 18:46:05,127 INFO L226 Difference]: Without dead ends: 20 [2019-11-27 18:46:05,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:46:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-27 18:46:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-27 18:46:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-27 18:46:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-27 18:46:05,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-11-27 18:46:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:05,135 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-27 18:46:05,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:46:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-27 18:46:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 18:46:05,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:05,137 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:46:05,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 18:46:05,348 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:46:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:05,349 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-27 18:46:05,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:46:05,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489117056] [2019-11-27 18:46:05,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 18:46:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:05,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:46:05,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:46:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:05,539 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:46:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:05,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489117056] [2019-11-27 18:46:05,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:46:05,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 18:46:05,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25440896] [2019-11-27 18:46:05,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:46:05,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:46:05,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:46:05,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:46:05,698 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 10 states. [2019-11-27 18:46:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:06,095 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-11-27 18:46:06,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:46:06,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-27 18:46:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:06,098 INFO L225 Difference]: With dead ends: 45 [2019-11-27 18:46:06,098 INFO L226 Difference]: Without dead ends: 20 [2019-11-27 18:46:06,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:46:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-27 18:46:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-27 18:46:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-27 18:46:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-27 18:46:06,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-11-27 18:46:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:06,106 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-27 18:46:06,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:46:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-11-27 18:46:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 18:46:06,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:06,107 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:46:06,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 18:46:06,318 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:46:06,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:06,319 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-27 18:46:06,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:46:06,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126090240] [2019-11-27 18:46:06,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 18:46:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:06,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-27 18:46:06,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:46:06,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,495 INFO L377 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 5 treesize of output 3 [2019-11-27 18:46:06,495 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:46:06,605 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-27 18:46:06,605 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:46:06,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,616 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:46:06,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:46:06,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,645 INFO L343 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2019-11-27 18:46:06,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 55 [2019-11-27 18:46:06,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 11 [2019-11-27 18:46:06,667 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 18:46:06,682 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:46:06,682 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:46:06,724 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:46:06,724 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:46:06,725 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:119, output treesize:41 [2019-11-27 18:46:06,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:46:06,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:46:06,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 79 [2019-11-27 18:46:06,810 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:46:06,871 INFO L588 ElimStorePlain]: treesize reduction 32, result has 66.3 percent of original size [2019-11-27 18:46:06,871 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:46:06,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-11-27 18:46:06,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:06,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:07,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:07,001 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:46:07,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:46:07,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:46:07,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:46:07,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 127 treesize of output 140 [2019-11-27 18:46:07,064 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:46:07,177 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-27 18:46:07,178 INFO L588 ElimStorePlain]: treesize reduction 63, result has 64.0 percent of original size [2019-11-27 18:46:07,180 INFO L508 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. [2019-11-27 18:46:07,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:130, output treesize:112 [2019-11-27 18:46:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:46:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:07,539 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:46:10,618 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-27 18:46:11,957 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-27 18:46:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:11,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126090240] [2019-11-27 18:46:11,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:46:11,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-27 18:46:11,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987978275] [2019-11-27 18:46:11,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:46:11,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:46:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:46:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2019-11-27 18:46:11,997 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 16 states. [2019-11-27 18:46:34,384 WARN L192 SmtUtils]: Spent 21.58 s on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-11-27 18:46:44,855 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-27 18:47:06,607 WARN L192 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-11-27 18:47:07,677 WARN L192 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 62 [2019-11-27 18:47:10,513 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2019-11-27 18:47:11,109 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-27 18:47:13,620 WARN L192 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 128 DAG size of output: 62 [2019-11-27 18:47:15,436 WARN L192 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 66 [2019-11-27 18:47:16,116 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-27 18:47:17,206 WARN L192 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 66 [2019-11-27 18:47:17,526 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-27 18:47:17,806 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-27 18:47:20,832 WARN L192 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2019-11-27 18:47:23,860 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 123 DAG size of output: 66 [2019-11-27 18:47:24,238 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-11-27 18:47:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:24,503 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-11-27 18:47:24,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-27 18:47:24,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-11-27 18:47:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:24,504 INFO L225 Difference]: With dead ends: 49 [2019-11-27 18:47:24,505 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 18:47:24,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 62.6s TimeCoverageRelationStatistics Valid=255, Invalid=928, Unknown=7, NotChecked=0, Total=1190 [2019-11-27 18:47:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 18:47:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 18:47:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 18:47:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 18:47:24,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-27 18:47:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:24,508 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 18:47:24,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:47:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 18:47:24,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 18:47:24,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 18:47:24,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 18:47:25,507 WARN L192 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-11-27 18:47:25,887 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-11-27 18:47:34,592 WARN L192 SmtUtils]: Spent 8.70 s on a formula simplification that was a NOOP. DAG size: 105 [2019-11-27 18:47:34,595 INFO L246 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-27 18:47:34,595 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 18:47:34,595 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 18:47:34,595 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 18:47:34,595 INFO L246 CegarLoopResult]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2019-11-27 18:47:34,596 INFO L242 CegarLoopResult]: At program point L28-3(lines 28 31) the Hoare annotation is: (let ((.cse20 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse18 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (let ((.cse19 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (.cse23 (select .cse20 .cse18)) (.cse24 ((_ sign_extend 32) (_ bv1 32))) (.cse8 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse0 (= ((_ extract 31 0) .cse24) (select .cse8 ULTIMATE.start_main_~b~0.offset))) (.cse1 (= .cse23 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32))))) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse3 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse22 (= ((_ extract 63 32) .cse24) (select .cse8 .cse19))) (.cse21 ((_ sign_extend 32) (_ bv20 32)))) (or (let ((.cse9 (bvmul ULTIMATE.start_main_~i~0 (_ bv8 32)))) (let ((.cse4 ((_ sign_extend 32) (_ bv3 32))) (.cse7 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32))) (.cse6 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) (.cse11 (concat (select .cse20 (bvadd ULTIMATE.start_main_~a~0.offset .cse9 (_ bv4294967292 32))) (select .cse20 (bvadd ULTIMATE.start_main_~a~0.offset .cse9 (_ bv4294967288 32)))))) (and .cse0 .cse1 .cse2 (bvsle ~N~0 (_ bv536870911 32)) .cse3 (let ((.cse10 (bvadd (concat (select .cse8 (bvadd .cse9 ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse8 (bvadd .cse9 ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32)))) .cse11))) (let ((.cse5 (store .cse8 (bvadd .cse9 ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) .cse10)))) (or (= .cse4 (concat (select .cse5 .cse6) (select .cse5 .cse7))) (not (= (store |#memory_int| ULTIMATE.start_main_~b~0.base .cse5) (store |#memory_int| ULTIMATE.start_main_~b~0.base (store .cse8 (bvadd .cse9 ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) .cse10)))))))) (not (bvsle ~N~0 (_ bv0 32))) (let ((.cse17 (store .cse20 (bvadd ULTIMATE.start_main_~a~0.offset .cse9) ((_ extract 31 0) (bvadd .cse21 .cse11))))) (let ((.cse14 (store |#memory_int| ULTIMATE.start_main_~a~0.base .cse17))) (let ((.cse15 (select .cse14 ULTIMATE.start_main_~b~0.base))) (let ((.cse16 (bvadd (concat (select .cse17 .cse18) (select .cse17 ULTIMATE.start_main_~a~0.offset)) (concat (select .cse15 .cse19) (select .cse15 ULTIMATE.start_main_~b~0.offset))))) (let ((.cse12 ((_ extract 63 32) .cse16))) (let ((.cse13 (store .cse15 .cse6 .cse12))) (or (= .cse4 (concat .cse12 (select .cse13 .cse7))) (not (= (store .cse14 ULTIMATE.start_main_~b~0.base (store .cse15 .cse7 ((_ extract 31 0) .cse16))) (store .cse14 ULTIMATE.start_main_~b~0.base .cse13)))))))))) .cse22 (= (_ bv1 32) ULTIMATE.start_main_~i~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse22 (= (select .cse20 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse21 (concat .cse23 (select .cse20 ULTIMATE.start_main_~a~0.offset)))))))))) [2019-11-27 18:47:34,596 INFO L246 CegarLoopResult]: For program point L28-4(lines 28 31) no Hoare annotation was computed. [2019-11-27 18:47:34,596 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-27 18:47:34,596 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 18:47:34,596 INFO L246 CegarLoopResult]: For program point L33-2(lines 33 36) no Hoare annotation was computed. [2019-11-27 18:47:34,596 INFO L242 CegarLoopResult]: At program point L33-3(lines 33 36) the Hoare annotation is: (let ((.cse11 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse12 (select .cse11 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (.cse13 ((_ sign_extend 32) (_ bv1 32))) (.cse14 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse0 (= ((_ extract 31 0) .cse13) (select .cse14 ULTIMATE.start_main_~b~0.offset))) (.cse1 (= .cse12 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32))))) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse3 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse4 (= ((_ extract 63 32) .cse13) (select .cse14 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))))) (.cse5 (= (select .cse11 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv20 32)) (concat .cse12 (select .cse11 ULTIMATE.start_main_~a~0.offset))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ULTIMATE.start_main_~i~0)) (and .cse0 .cse3 (not (bvslt (_ bv1 32) ~N~0)) (not (bvsle ~N~0 (_ bv0 32))) .cse4 (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse8 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse7 (concat .cse8 (select .cse6 (_ bv0 32)))) (.cse10 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse9 (bvadd .cse7 (concat (select .cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))))))) (and (= (select .cse6 (_ bv8 32)) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv20 32)) .cse7))) (= (select .cse6 (_ bv4 32)) .cse8) (= ((_ extract 31 0) .cse9) (select .cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32)))) (= (select .cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) .cse9)))))))))))) [2019-11-27 18:47:34,596 INFO L246 CegarLoopResult]: For program point L33-4(lines 33 36) no Hoare annotation was computed. [2019-11-27 18:47:34,597 INFO L249 CegarLoopResult]: At program point L42(lines 16 43) the Hoare annotation is: true [2019-11-27 18:47:34,597 INFO L246 CegarLoopResult]: For program point L38-2(lines 38 41) no Hoare annotation was computed. [2019-11-27 18:47:34,597 INFO L242 CegarLoopResult]: At program point L38-3(lines 38 41) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse16 ((_ sign_extend 32) (_ bv1 32))) (.cse17 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse15 (select .cse14 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))))) (let ((.cse4 (= (_ bv0 32) ULTIMATE.start_main_~i~0)) (.cse5 (= .cse15 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32))))) (.cse0 (= ((_ extract 31 0) .cse16) (select .cse17 ULTIMATE.start_main_~b~0.offset))) (.cse6 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse2 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (.cse3 (= ((_ extract 63 32) .cse16) (select .cse17 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))))) (.cse7 (= (select .cse14 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv20 32)) (concat .cse15 (select .cse14 ULTIMATE.start_main_~a~0.offset)))))) (.cse8 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse11 ((_ extract 63 32) ((_ sign_extend 32) (_ bv2 32)))) (.cse9 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse10 (concat .cse11 (select .cse9 (_ bv0 32)))) (.cse13 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse12 (bvadd .cse10 (concat (select .cse13 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))))))) (and (= (select .cse9 (_ bv8 32)) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv20 32)) .cse10))) (= (select .cse9 (_ bv4 32)) .cse11) (= ((_ extract 31 0) .cse12) (select .cse13 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32)))) (= (select .cse13 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) .cse12))))))))) (or (and .cse0 (not (bvslt (_ bv1 32) ~N~0)) .cse1 (not (bvslt ULTIMATE.start_main_~i~0 ~N~0)) .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3 (not (bvslt (bvadd ULTIMATE.start_main_~i~0 (_ bv1 32)) ~N~0))) (and .cse0 .cse5 .cse6 .cse1 .cse4 .cse3 .cse7 .cse8) (and .cse5 .cse0 .cse6 .cse1 (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) .cse2 .cse3 .cse7 .cse8))))) [2019-11-27 18:47:34,597 INFO L246 CegarLoopResult]: For program point L38-4(lines 38 41) no Hoare annotation was computed. [2019-11-27 18:47:34,597 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-27 18:47:34,597 INFO L246 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-27 18:47:34,597 INFO L246 CegarLoopResult]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-27 18:47:34,610 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.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:106) 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:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) 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:120) 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) [2019-11-27 18:47:34,617 INFO L168 Benchmark]: Toolchain (without parser) took 92081.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 961.7 MB in the beginning and 928.5 MB in the end (delta: 33.2 MB). Peak memory consumption was 230.9 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:34,617 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:47:34,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:34,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:47:34,622 INFO L168 Benchmark]: Boogie Preprocessor took 32.92 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:34,631 INFO L168 Benchmark]: RCFGBuilder took 418.47 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:34,634 INFO L168 Benchmark]: TraceAbstraction took 91166.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 928.5 MB in the end (delta: 182.0 MB). Peak memory consumption was 239.1 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:34,640 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.92 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 418.47 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 91166.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 928.5 MB in the end (delta: 182.0 MB). Peak memory consumption was 239.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 16]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...