/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1203da81dc5c48f4dda347acec83e1939b55600b ............................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1203da81dc5c48f4dda347acec83e1939b55600b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:31:51,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:51,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:51,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:51,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:51,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:51,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:51,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:51,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:51,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:51,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:51,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:51,109 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:51,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:51,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:51,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:51,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:51,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:51,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:51,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:51,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:51,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:51,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:51,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:51,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:51,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:51,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:51,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:51,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:51,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:51,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:51,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:51,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:51,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:51,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:51,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:51,134 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:31:51,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:51,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:51,152 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:51,152 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:51,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:51,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:51,153 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:51,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:51,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:51,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:31:51,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:51,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:51,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:51,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:51,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:51,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:51,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:51,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:51,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:51,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:51,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:51,156 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:51,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:51,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:51,157 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:51,157 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:51,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:31:51,158 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:51,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:31:51,158 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1203da81dc5c48f4dda347acec83e1939b55600b [2018-09-20 15:31:51,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:51,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:51,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:51,245 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:51,246 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:51,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c [2018-09-20 15:31:51,609 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9458aa3b/777ed1b162024f22b0f5a27c89357cbb/FLAG8f74f7b13 [2018-09-20 15:31:51,781 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:51,782 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c [2018-09-20 15:31:51,792 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9458aa3b/777ed1b162024f22b0f5a27c89357cbb/FLAG8f74f7b13 [2018-09-20 15:31:51,813 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9458aa3b/777ed1b162024f22b0f5a27c89357cbb [2018-09-20 15:31:51,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:51,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:51,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:51,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:51,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:51,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:51" (1/1) ... [2018-09-20 15:31:51,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb51be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:51, skipping insertion in model container [2018-09-20 15:31:51,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:51" (1/1) ... [2018-09-20 15:31:51,847 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:52,209 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:52,231 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:52,314 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:52,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52 WrapperNode [2018-09-20 15:31:52,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:52,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:52,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:52,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:52,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:52,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:52,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:52,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:52,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-20 15:31:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-09-20 15:31:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-20 15:31:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-20 15:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:31:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:31:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:31:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-09-20 15:31:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-20 15:31:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:31:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:31:53,952 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:31:53,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:53 BoogieIcfgContainer [2018-09-20 15:31:53,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:31:53,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:31:53,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:31:53,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:31:53,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:51" (1/3) ... [2018-09-20 15:31:53,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f32a587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:53, skipping insertion in model container [2018-09-20 15:31:53,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (2/3) ... [2018-09-20 15:31:53,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f32a587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:53, skipping insertion in model container [2018-09-20 15:31:53,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:53" (3/3) ... [2018-09-20 15:31:53,963 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b_true-unreach-call.c [2018-09-20 15:31:53,972 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:31:53,980 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:31:54,029 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:31:54,029 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:31:54,030 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:31:54,030 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:31:54,030 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:31:54,030 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:31:54,030 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:31:54,030 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:31:54,031 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:31:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states. [2018-09-20 15:31:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-20 15:31:54,068 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:54,070 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:54,072 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2013009825, now seen corresponding path program 1 times [2018-09-20 15:31:54,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:54,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:54,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:54,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:54,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:31:54,238 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:54,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:31:54,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:31:54,259 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:31:54,260 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:54,263 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 2 states. [2018-09-20 15:31:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:54,319 INFO L93 Difference]: Finished difference Result 456 states and 573 transitions. [2018-09-20 15:31:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:31:54,322 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-09-20 15:31:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:54,341 INFO L225 Difference]: With dead ends: 456 [2018-09-20 15:31:54,341 INFO L226 Difference]: Without dead ends: 228 [2018-09-20 15:31:54,348 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-20 15:31:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-20 15:31:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-20 15:31:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 250 transitions. [2018-09-20 15:31:54,419 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 250 transitions. Word has length 28 [2018-09-20 15:31:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:54,419 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 250 transitions. [2018-09-20 15:31:54,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:31:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 250 transitions. [2018-09-20 15:31:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:31:54,424 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:54,425 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:54,425 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash 237649631, now seen corresponding path program 1 times [2018-09-20 15:31:54,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:54,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:54,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:31:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:31:54,756 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:31:54,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:31:54 BoogieIcfgContainer [2018-09-20 15:31:54,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:31:54,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:31:54,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:31:54,867 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:31:54,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:53" (3/4) ... [2018-09-20 15:31:54,873 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:31:54,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:31:54,876 INFO L168 Benchmark]: Toolchain (without parser) took 3057.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -82.6 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:54,879 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:31:54,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.55 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:54,882 INFO L168 Benchmark]: Boogie Preprocessor took 71.31 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:54,884 INFO L168 Benchmark]: RCFGBuilder took 1520.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:54,886 INFO L168 Benchmark]: TraceAbstraction took 912.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:54,887 INFO L168 Benchmark]: Witness Printer took 7.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:31:54,894 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 537.55 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.31 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1520.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 912.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. * Witness Printer took 7.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 235]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418246, \old(tiny_sqrt)=10737418251, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = -1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [L232] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418243, \old(y)=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L82] float a = x, b = y, t1, t2, y1, y2, w; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L86] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L87] FCALL gf_u.value = (x) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] EXPR, FCALL gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] (ha) = gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] FCALL (ha) = gf_u.word VAL [(ha) = gf_u.word=10737418247, \old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L89] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L90] ha &= 0x7fffffffL VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L92] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L93] FCALL gf_u.value = (y) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] EXPR, FCALL gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] (hb) = gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] FCALL (hb) = gf_u.word VAL [(hb) = gf_u.word=10737418256, \old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L95] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L96] hb &= 0x7fffffffL VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L108] FCALL ieee_float_shape_type sf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L109] FCALL sf_u.word = (ha) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] EXPR, FCALL sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] (a) = sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] FCALL (a) = sf_u.value VAL [(a) = sf_u.value=10737418254, \old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L111] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L113] FCALL ieee_float_shape_type sf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L114] FCALL sf_u.word = (hb) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L115] EXPR, FCALL sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L115] (b) = sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L115] FCALL (b) = sf_u.value VAL [(b) = sf_u.value=10737418253, \old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L116] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L117] COND TRUE (ha - hb) > 0xf000000L [L118] RET return a + b; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L232] EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L232] float res = __ieee754_hypotf(x, y); [L234] CALL, EXPR isinf_float(res) VAL [\old(x)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L212] __int32_t ix; VAL [\old(x)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L214] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418241, gf_u={10737418244:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L215] FCALL gf_u.value = (x) VAL [\old(x)=10737418241, gf_u={10737418244:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] EXPR, FCALL gf_u.word VAL [\old(x)=10737418241, gf_u={10737418244:0}, gf_u.word=-6442450944, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] (ix) = gf_u.word VAL [\old(x)=10737418241, gf_u={10737418244:0}, gf_u.word=-6442450944, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] FCALL (ix) = gf_u.word VAL [(ix) = gf_u.word=10737418250, \old(x)=10737418241, gf_u={10737418244:0}, gf_u.word=-6442450944, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L217] COND FALSE !(0) VAL [\old(x)=10737418241, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L218] ix &= 0x7fffffff [L219] RET return ((ix) == 0x7f800000L); VAL [\old(x)=10737418241, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L234] EXPR isinf_float(res) VAL [isinf_float(res)=0, one_sqrt=1, res=10737418241, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L234] COND TRUE !isinf_float(res) [L235] __VERIFIER_error() VAL [one_sqrt=1, res=10737418241, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 232 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 15:31:57,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:57,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:57,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:57,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:57,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:57,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:57,402 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:57,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:57,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:57,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:57,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:57,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:57,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:57,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:57,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:57,416 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:57,419 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:57,423 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:57,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:57,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:57,429 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:57,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:57,434 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:57,434 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:57,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:57,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:57,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:57,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:57,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:57,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:57,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:57,444 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:57,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:57,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:57,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:57,447 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:31:57,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:57,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:57,464 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:57,464 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:57,465 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:57,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:57,466 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:57,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:57,467 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:57,467 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:57,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:57,467 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:57,467 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:57,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:57,468 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:31:57,468 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:31:57,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:57,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:57,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:57,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:57,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:57,470 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:57,470 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:57,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:57,471 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:57,471 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:57,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:57,471 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:31:57,472 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:57,472 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:31:57,472 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:31:57,472 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1203da81dc5c48f4dda347acec83e1939b55600b [2018-09-20 15:31:57,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:57,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:57,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:57,550 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:57,551 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:57,552 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c [2018-09-20 15:31:57,936 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05027699/7d88a924256f4805bc3fbe611dcea60e/FLAG0c2c19705 [2018-09-20 15:31:58,129 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:58,130 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c [2018-09-20 15:31:58,139 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05027699/7d88a924256f4805bc3fbe611dcea60e/FLAG0c2c19705 [2018-09-20 15:31:58,155 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05027699/7d88a924256f4805bc3fbe611dcea60e [2018-09-20 15:31:58,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:58,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:58,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:58,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:58,171 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:58,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315d9cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58, skipping insertion in model container [2018-09-20 15:31:58,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,189 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:58,576 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:58,596 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:58,659 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:58,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58 WrapperNode [2018-09-20 15:31:58,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:58,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:58,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:58,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:58,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:58,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:58,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:58,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:58,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-20 15:31:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-09-20 15:31:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-20 15:31:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-20 15:31:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-20 15:31:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:31:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:31:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-20 15:31:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-09-20 15:31:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-20 15:31:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:31:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-20 15:31:59,236 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:59,278 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:59,441 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:59,458 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:59,499 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:59,509 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:00,633 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:00,639 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:01,304 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:32:01,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:01 BoogieIcfgContainer [2018-09-20 15:32:01,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:32:01,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:32:01,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:32:01,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:32:01,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:58" (1/3) ... [2018-09-20 15:32:01,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef0379e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:01, skipping insertion in model container [2018-09-20 15:32:01,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58" (2/3) ... [2018-09-20 15:32:01,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef0379e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:01, skipping insertion in model container [2018-09-20 15:32:01,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:01" (3/3) ... [2018-09-20 15:32:01,317 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b_true-unreach-call.c [2018-09-20 15:32:01,326 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:32:01,333 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:32:01,380 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:32:01,380 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:32:01,381 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:32:01,381 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:32:01,381 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:32:01,381 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:32:01,381 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:32:01,381 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:32:01,381 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:32:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2018-09-20 15:32:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:32:01,423 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:01,424 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:01,427 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1998677788, now seen corresponding path program 1 times [2018-09-20 15:32:01,439 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:32:01,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:01,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:01,590 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:01,610 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:01,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:32:01,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:32:01,634 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:32:01,635 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:01,638 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 2 states. [2018-09-20 15:32:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:01,737 INFO L93 Difference]: Finished difference Result 454 states and 571 transitions. [2018-09-20 15:32:01,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:32:01,739 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-20 15:32:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:01,762 INFO L225 Difference]: With dead ends: 454 [2018-09-20 15:32:01,762 INFO L226 Difference]: Without dead ends: 227 [2018-09-20 15:32:01,776 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-20 15:32:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-20 15:32:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-20 15:32:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2018-09-20 15:32:01,854 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 27 [2018-09-20 15:32:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:01,855 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2018-09-20 15:32:01,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:32:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2018-09-20 15:32:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:01,860 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:01,860 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:01,861 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash -711257081, now seen corresponding path program 1 times [2018-09-20 15:32:01,863 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:01,863 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:32:01,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:02,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:02,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:02,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:02,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:02,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:02,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:02,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:02,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:02,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:02,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:02,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:02,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:02,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:03,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:03,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:03,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:32:03,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:32:03,412 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:32:03,414 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:32:03,414 INFO L87 Difference]: Start difference. First operand 227 states and 249 transitions. Second operand 11 states. [2018-09-20 15:32:04,229 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-20 15:32:04,495 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-20 15:32:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:57,649 INFO L93 Difference]: Finished difference Result 533 states and 581 transitions. [2018-09-20 15:32:57,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:32:57,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-09-20 15:32:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:57,658 INFO L225 Difference]: With dead ends: 533 [2018-09-20 15:32:57,659 INFO L226 Difference]: Without dead ends: 348 [2018-09-20 15:32:57,662 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:32:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-09-20 15:32:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 275. [2018-09-20 15:32:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-20 15:32:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 299 transitions. [2018-09-20 15:32:57,696 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 299 transitions. Word has length 72 [2018-09-20 15:32:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:57,696 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 299 transitions. [2018-09-20 15:32:57,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:32:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 299 transitions. [2018-09-20 15:32:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:57,701 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:57,701 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:57,701 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash -463110587, now seen corresponding path program 1 times [2018-09-20 15:32:57,703 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:57,704 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:32:57,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:57,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:57,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:57,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:57,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:57,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:57,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:57,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:57,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:57,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:57,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:57,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:57,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:57,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:58,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:58,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:58,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:58,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:58,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:58,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-09-20 15:32:58,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:58,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:58,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:58,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:58,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:58,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:29 [2018-09-20 15:32:58,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:58,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:58,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:58,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:58,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:58,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-09-20 15:32:59,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:59,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:59,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:59,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:59,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:59,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2018-09-20 15:33:00,475 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-20 15:33:03,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:33:03,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:03,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:03,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:33:03,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:03,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:04,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:04,945 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:04,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-09-20 15:33:04,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-20 15:33:04,947 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-20 15:33:04,948 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-09-20 15:33:04,948 INFO L87 Difference]: Start difference. First operand 275 states and 299 transitions. Second operand 24 states. [2018-09-20 15:33:10,012 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-20 15:33:10,612 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:33:10,914 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-09-20 15:33:19,738 WARN L178 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-20 15:33:22,325 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:33:25,531 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:33:29,946 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-20 15:33:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:53,969 INFO L93 Difference]: Finished difference Result 290 states and 317 transitions. [2018-09-20 15:33:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-20 15:33:54,031 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-09-20 15:33:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:54,034 INFO L225 Difference]: With dead ends: 290 [2018-09-20 15:33:54,034 INFO L226 Difference]: Without dead ends: 283 [2018-09-20 15:33:54,036 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=271, Invalid=2279, Unknown=0, NotChecked=0, Total=2550 [2018-09-20 15:33:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-20 15:33:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2018-09-20 15:33:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-20 15:33:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 298 transitions. [2018-09-20 15:33:54,059 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 298 transitions. Word has length 72 [2018-09-20 15:33:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:54,060 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 298 transitions. [2018-09-20 15:33:54,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-20 15:33:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 298 transitions. [2018-09-20 15:33:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:33:54,066 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:54,067 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:54,067 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash -463560330, now seen corresponding path program 1 times [2018-09-20 15:33:54,068 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:54,068 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:33:54,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:54,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:54,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:33:54,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:54,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:54,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:33:54,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:54,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:54,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-20 15:33:54,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-20 15:33:54,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:54,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:33:54,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-20 15:33:54,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-20 15:33:54,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:54,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:33:55,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:33:55,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:55,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:55,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:33:55,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:55,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:55,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:55,978 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:55,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-20 15:33:55,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 15:33:55,980 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 15:33:55,980 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:33:55,980 INFO L87 Difference]: Start difference. First operand 275 states and 298 transitions. Second operand 22 states. [2018-09-20 15:34:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:34:23,796 INFO L93 Difference]: Finished difference Result 374 states and 404 transitions. [2018-09-20 15:34:23,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-20 15:34:23,797 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2018-09-20 15:34:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:34:23,800 INFO L225 Difference]: With dead ends: 374 [2018-09-20 15:34:23,800 INFO L226 Difference]: Without dead ends: 366 [2018-09-20 15:34:23,802 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2018-09-20 15:34:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-09-20 15:34:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 278. [2018-09-20 15:34:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-20 15:34:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 303 transitions. [2018-09-20 15:34:23,825 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 303 transitions. Word has length 77 [2018-09-20 15:34:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:34:23,825 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 303 transitions. [2018-09-20 15:34:23,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 15:34:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 303 transitions. [2018-09-20 15:34:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:34:23,829 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:34:23,829 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:34:23,830 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:34:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash -244705612, now seen corresponding path program 1 times [2018-09-20 15:34:23,831 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:34:23,831 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:34:23,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:34:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:34:23,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:34:23,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:34:23,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:34:23,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:34:23,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:23,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:23,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:34:24,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:34:24,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:34:24,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:34:24,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:24,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:24,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:34:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:34:24,305 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:34:24,316 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:34:24,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:34:24,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:34:24,318 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:34:24,319 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:34:24,319 INFO L87 Difference]: Start difference. First operand 278 states and 303 transitions. Second operand 10 states. [2018-09-20 15:35:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:35:21,370 INFO L93 Difference]: Finished difference Result 468 states and 504 transitions. [2018-09-20 15:35:21,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:35:21,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-09-20 15:35:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:35:21,374 INFO L225 Difference]: With dead ends: 468 [2018-09-20 15:35:21,374 INFO L226 Difference]: Without dead ends: 306 [2018-09-20 15:35:21,375 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:35:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-20 15:35:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2018-09-20 15:35:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-20 15:35:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 270 transitions. [2018-09-20 15:35:21,397 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 270 transitions. Word has length 77 [2018-09-20 15:35:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:35:21,397 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 270 transitions. [2018-09-20 15:35:21,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:35:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 270 transitions. [2018-09-20 15:35:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:35:21,400 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:35:21,400 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:35:21,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:35:21,401 INFO L82 PathProgramCache]: Analyzing trace with hash 988789622, now seen corresponding path program 1 times [2018-09-20 15:35:21,402 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:35:21,402 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:35:21,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:35:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:35:21,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:35:21,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:35:21,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:35:21,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:35:21,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-09-20 15:35:21,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:35:21,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:35:21,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:35:21,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:35:21,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:35:21,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:35:21,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:35:21,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:35:21,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:35:21,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:21,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:35:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:35:22,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:35:22,180 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:35:22,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-20 15:35:22,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-20 15:35:22,181 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-20 15:35:22,181 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:35:22,181 INFO L87 Difference]: Start difference. First operand 251 states and 270 transitions. Second operand 16 states. [2018-09-20 15:35:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:35:36,977 INFO L93 Difference]: Finished difference Result 314 states and 337 transitions. [2018-09-20 15:35:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:35:36,978 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-09-20 15:35:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:35:36,980 INFO L225 Difference]: With dead ends: 314 [2018-09-20 15:35:36,980 INFO L226 Difference]: Without dead ends: 306 [2018-09-20 15:35:36,981 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-09-20 15:35:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-20 15:35:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2018-09-20 15:35:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-20 15:35:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 269 transitions. [2018-09-20 15:35:36,998 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 269 transitions. Word has length 77 [2018-09-20 15:35:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:35:36,998 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 269 transitions. [2018-09-20 15:35:36,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-20 15:35:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 269 transitions. [2018-09-20 15:35:37,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:35:37,001 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:35:37,001 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:35:37,002 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:35:37,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1207644340, now seen corresponding path program 1 times [2018-09-20 15:35:37,002 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:35:37,002 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:35:37,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:35:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:35:37,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:35:37,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:35:37,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:35:37,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:35:37,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:35:37,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:35:37,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:35:37,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-20 15:35:37,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-20 15:35:37,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:35:37,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:35:37,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-20 15:35:37,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-20 15:35:37,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:35:37,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:35:37,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:35:37,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:35:37,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:37,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:35:38,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:35:38,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:35:38,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:38,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:38,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:38,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:35:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:35:38,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:35:38,367 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:35:38,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-20 15:35:38,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-20 15:35:38,368 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-20 15:35:38,368 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:35:38,368 INFO L87 Difference]: Start difference. First operand 251 states and 269 transitions. Second operand 21 states. [2018-09-20 15:36:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:36:06,080 INFO L93 Difference]: Finished difference Result 258 states and 276 transitions. [2018-09-20 15:36:06,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-20 15:36:06,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 77 [2018-09-20 15:36:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:36:06,083 INFO L225 Difference]: With dead ends: 258 [2018-09-20 15:36:06,083 INFO L226 Difference]: Without dead ends: 225 [2018-09-20 15:36:06,085 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=179, Invalid=1627, Unknown=0, NotChecked=0, Total=1806 [2018-09-20 15:36:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-20 15:36:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-20 15:36:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-20 15:36:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 242 transitions. [2018-09-20 15:36:06,100 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 242 transitions. Word has length 77 [2018-09-20 15:36:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:36:06,101 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 242 transitions. [2018-09-20 15:36:06,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-20 15:36:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 242 transitions. [2018-09-20 15:36:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-20 15:36:06,102 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:36:06,104 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:36:06,104 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:36:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1253625132, now seen corresponding path program 1 times [2018-09-20 15:36:06,105 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:36:06,105 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-20 15:36:06,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:36:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:36:06,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:36:06,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:36:06,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:36:06,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:06,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:06,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:06,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:36:06,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:36:06,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:36:06,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:06,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:06,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:06,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:36:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:36:06,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:36:06,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:36:06,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:36:06,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:36:06,998 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:36:06,998 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:36:07,000 INFO L87 Difference]: Start difference. First operand 225 states and 242 transitions. Second operand 11 states. [2018-09-20 15:36:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:36:57,874 INFO L93 Difference]: Finished difference Result 403 states and 431 transitions. [2018-09-20 15:36:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:36:57,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-09-20 15:36:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:36:57,878 INFO L225 Difference]: With dead ends: 403 [2018-09-20 15:36:57,878 INFO L226 Difference]: Without dead ends: 245 [2018-09-20 15:36:57,880 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:36:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-20 15:36:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 191. [2018-09-20 15:36:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-20 15:36:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2018-09-20 15:36:57,902 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 96 [2018-09-20 15:36:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:36:57,903 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2018-09-20 15:36:57,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:36:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2018-09-20 15:36:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-20 15:36:57,904 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:36:57,906 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:36:57,907 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:36:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash -621518797, now seen corresponding path program 1 times [2018-09-20 15:36:57,908 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:36:57,909 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-20 15:36:57,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:36:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:36:58,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:36:58,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:36:58,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:36:58,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:36:58,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:36:58,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:36:58,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:36:58,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-20 15:36:58,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-20 15:36:58,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:36:58,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:36:58,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-20 15:36:58,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-20 15:36:58,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:58,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:36:58,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:37:03,006 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-20 15:37:24,413 WARN L178 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 19 [2018-09-20 15:37:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:37:24,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:37:24,598 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:37:24,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:37:24,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:37:24,599 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:37:24,599 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=149, Unknown=7, NotChecked=0, Total=182 [2018-09-20 15:37:24,599 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand 14 states. [2018-09-20 15:38:19,053 WARN L178 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:38:21,363 FATAL L265 ToolchainWalker]: 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) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:690) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:603) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-09-20 15:38:21,373 INFO L168 Benchmark]: Toolchain (without parser) took 383207.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.3 MB). Free memory was 951.8 MB in the beginning and 932.8 MB in the end (delta: 19.1 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:38:21,375 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:38:21,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.03 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:38:21,376 INFO L168 Benchmark]: Boogie Preprocessor took 85.00 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:38:21,377 INFO L168 Benchmark]: RCFGBuilder took 2519.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:38:21,377 INFO L168 Benchmark]: TraceAbstraction took 380059.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 932.8 MB in the end (delta: 144.2 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:38:21,383 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 537.03 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.00 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2519.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 380059.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 932.8 MB in the end (delta: 144.2 MB). Peak memory consumption was 243.8 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) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...