./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.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 0e04f2515dd5c7ce697460622800d33932bf1903 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.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 0e04f2515dd5c7ce697460622800d33932bf1903 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:38:49,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:49,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:49,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:49,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:49,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:49,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:49,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:49,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:49,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:49,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:49,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:49,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:49,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:49,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:49,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:49,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:49,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:49,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:49,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:49,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:49,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:49,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:49,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:49,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:49,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:49,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:49,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:49,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:49,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:49,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:49,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:49,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:49,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:49,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:49,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:49,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:49,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:49,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:49,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:49,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:49,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:38:49,617 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:49,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:49,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:49,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:49,620 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:49,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:49,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:49,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:38:49,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:49,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:49,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:49,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:49,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:49,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:49,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:49,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:49,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:49,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:49,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:49,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:49,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:49,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:49,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:49,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:49,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:49,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:38:49,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:38:49,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:49,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:49,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e04f2515dd5c7ce697460622800d33932bf1903 [2019-11-28 15:38:49,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:49,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:49,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:49,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:49,965 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:49,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-28 15:38:50,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c68620c/55553520b74c4ae390815a7d2339919c/FLAG3d2ac1cd8 [2019-11-28 15:38:50,534 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:50,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-28 15:38:50,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c68620c/55553520b74c4ae390815a7d2339919c/FLAG3d2ac1cd8 [2019-11-28 15:38:50,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c68620c/55553520b74c4ae390815a7d2339919c [2019-11-28 15:38:50,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:50,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:50,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:50,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:50,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:50,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9b4597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50, skipping insertion in model container [2019-11-28 15:38:50,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:50,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:51,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:51,265 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:51,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:51,417 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:51,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51 WrapperNode [2019-11-28 15:38:51,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:51,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:51,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:51,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:51,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:51,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:51,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:51,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:51,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... [2019-11-28 15:38:51,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:51,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:51,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:51,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:51,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:51,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:52,153 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:52,154 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-28 15:38:52,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:52 BoogieIcfgContainer [2019-11-28 15:38:52,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:52,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:52,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:52,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:52,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:50" (1/3) ... [2019-11-28 15:38:52,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b43e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:52, skipping insertion in model container [2019-11-28 15:38:52,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:51" (2/3) ... [2019-11-28 15:38:52,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b43e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:52, skipping insertion in model container [2019-11-28 15:38:52,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:52" (3/3) ... [2019-11-28 15:38:52,168 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2019-11-28 15:38:52,180 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:52,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 15:38:52,202 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 15:38:52,246 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:52,247 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:52,247 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:52,248 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:52,248 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:52,250 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:52,250 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:52,251 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-11-28 15:38:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:38:52,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:52,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:52,281 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash 934616753, now seen corresponding path program 1 times [2019-11-28 15:38:52,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:52,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740714602] [2019-11-28 15:38:52,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:52,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740714602] [2019-11-28 15:38:52,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:52,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 15:38:52,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705932958] [2019-11-28 15:38:52,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:38:52,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:52,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:38:52,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:38:52,756 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 8 states. [2019-11-28 15:38:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,228 INFO L93 Difference]: Finished difference Result 454 states and 688 transitions. [2019-11-28 15:38:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 15:38:54,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-28 15:38:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,257 INFO L225 Difference]: With dead ends: 454 [2019-11-28 15:38:54,258 INFO L226 Difference]: Without dead ends: 337 [2019-11-28 15:38:54,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-28 15:38:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-28 15:38:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 133. [2019-11-28 15:38:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 15:38:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2019-11-28 15:38:54,391 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 17 [2019-11-28 15:38:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,392 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2019-11-28 15:38:54,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:38:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2019-11-28 15:38:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:38:54,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:54,397 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,398 INFO L82 PathProgramCache]: Analyzing trace with hash 934676335, now seen corresponding path program 1 times [2019-11-28 15:38:54,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593454367] [2019-11-28 15:38:54,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:54,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593454367] [2019-11-28 15:38:54,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 15:38:54,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960435326] [2019-11-28 15:38:54,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:38:54,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:38:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:38:54,619 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 7 states. [2019-11-28 15:38:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,876 INFO L93 Difference]: Finished difference Result 288 states and 410 transitions. [2019-11-28 15:38:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 15:38:54,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-28 15:38:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,881 INFO L225 Difference]: With dead ends: 288 [2019-11-28 15:38:54,882 INFO L226 Difference]: Without dead ends: 204 [2019-11-28 15:38:54,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-28 15:38:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-28 15:38:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-11-28 15:38:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-28 15:38:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2019-11-28 15:38:54,928 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 17 [2019-11-28 15:38:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,929 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2019-11-28 15:38:54,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:38:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2019-11-28 15:38:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:38:54,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:54,933 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1341099622, now seen corresponding path program 1 times [2019-11-28 15:38:54,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079584537] [2019-11-28 15:38:54,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:55,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079584537] [2019-11-28 15:38:55,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 15:38:55,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891478668] [2019-11-28 15:38:55,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:38:55,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:38:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:38:55,175 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 8 states. [2019-11-28 15:38:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,579 INFO L93 Difference]: Finished difference Result 304 states and 404 transitions. [2019-11-28 15:38:55,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 15:38:55,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 15:38:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,581 INFO L225 Difference]: With dead ends: 304 [2019-11-28 15:38:55,581 INFO L226 Difference]: Without dead ends: 256 [2019-11-28 15:38:55,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-28 15:38:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-28 15:38:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 182. [2019-11-28 15:38:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-28 15:38:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 256 transitions. [2019-11-28 15:38:55,610 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 256 transitions. Word has length 21 [2019-11-28 15:38:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,612 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 256 transitions. [2019-11-28 15:38:55,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:38:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 256 transitions. [2019-11-28 15:38:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:38:55,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,623 INFO L410 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] [2019-11-28 15:38:55,624 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1901024439, now seen corresponding path program 1 times [2019-11-28 15:38:55,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578767667] [2019-11-28 15:38:55,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:55,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578767667] [2019-11-28 15:38:55,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:55,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954676345] [2019-11-28 15:38:55,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:55,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:55,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,686 INFO L87 Difference]: Start difference. First operand 182 states and 256 transitions. Second operand 3 states. [2019-11-28 15:38:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,714 INFO L93 Difference]: Finished difference Result 336 states and 472 transitions. [2019-11-28 15:38:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:55,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:38:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,717 INFO L225 Difference]: With dead ends: 336 [2019-11-28 15:38:55,718 INFO L226 Difference]: Without dead ends: 261 [2019-11-28 15:38:55,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-28 15:38:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 232. [2019-11-28 15:38:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-28 15:38:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 321 transitions. [2019-11-28 15:38:55,733 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 321 transitions. Word has length 25 [2019-11-28 15:38:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,734 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 321 transitions. [2019-11-28 15:38:55,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 321 transitions. [2019-11-28 15:38:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:38:55,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,737 INFO L410 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] [2019-11-28 15:38:55,737 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash 186737553, now seen corresponding path program 1 times [2019-11-28 15:38:55,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233583233] [2019-11-28 15:38:55,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:55,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233583233] [2019-11-28 15:38:55,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:38:55,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386099102] [2019-11-28 15:38:55,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:38:55,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:38:55,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:38:55,885 INFO L87 Difference]: Start difference. First operand 232 states and 321 transitions. Second operand 6 states. [2019-11-28 15:38:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:56,078 INFO L93 Difference]: Finished difference Result 358 states and 490 transitions. [2019-11-28 15:38:56,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:38:56,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 15:38:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:56,081 INFO L225 Difference]: With dead ends: 358 [2019-11-28 15:38:56,081 INFO L226 Difference]: Without dead ends: 193 [2019-11-28 15:38:56,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:38:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-28 15:38:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2019-11-28 15:38:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-28 15:38:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2019-11-28 15:38:56,097 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 25 [2019-11-28 15:38:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:56,098 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2019-11-28 15:38:56,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:38:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2019-11-28 15:38:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:38:56,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:56,103 INFO L410 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] [2019-11-28 15:38:56,103 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:56,104 INFO L82 PathProgramCache]: Analyzing trace with hash -873114857, now seen corresponding path program 1 times [2019-11-28 15:38:56,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:56,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582564209] [2019-11-28 15:38:56,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:56,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582564209] [2019-11-28 15:38:56,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:56,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:38:56,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132490994] [2019-11-28 15:38:56,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:38:56,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:38:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:38:56,166 INFO L87 Difference]: Start difference. First operand 182 states and 248 transitions. Second operand 5 states. [2019-11-28 15:38:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:56,247 INFO L93 Difference]: Finished difference Result 313 states and 430 transitions. [2019-11-28 15:38:56,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:38:56,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 15:38:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:56,250 INFO L225 Difference]: With dead ends: 313 [2019-11-28 15:38:56,250 INFO L226 Difference]: Without dead ends: 238 [2019-11-28 15:38:56,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:38:56,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-28 15:38:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2019-11-28 15:38:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-28 15:38:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 252 transitions. [2019-11-28 15:38:56,263 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 252 transitions. Word has length 29 [2019-11-28 15:38:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:56,263 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 252 transitions. [2019-11-28 15:38:56,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:38:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2019-11-28 15:38:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:38:56,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:56,265 INFO L410 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] [2019-11-28 15:38:56,265 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:56,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1737423153, now seen corresponding path program 1 times [2019-11-28 15:38:56,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:56,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783066622] [2019-11-28 15:38:56,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:56,408 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:38:56,409 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:38:56,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:38:56 BoogieIcfgContainer [2019-11-28 15:38:56,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:38:56,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:38:56,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:38:56,466 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:38:56,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:52" (3/4) ... [2019-11-28 15:38:56,471 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 15:38:56,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:38:56,475 INFO L168 Benchmark]: Toolchain (without parser) took 5601.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -203.2 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:56,476 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:56,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:56,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:56,486 INFO L168 Benchmark]: Boogie Preprocessor took 33.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:56,487 INFO L168 Benchmark]: RCFGBuilder took 640.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:56,487 INFO L168 Benchmark]: TraceAbstraction took 4302.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:56,490 INFO L168 Benchmark]: Witness Printer took 9.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:56,496 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 545.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 640.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4302.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 9.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add ; [L223] unsigned int zero ; [L224] int sa ; [L225] int sb ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int tmp___1 ; [L229] int tmp___2 ; [L230] int tmp___3 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L233] int tmp___6 ; [L234] int tmp___7 ; [L235] int tmp___8 ; [L236] int tmp___9 ; [L237] int __retres23 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L241] zero = base2flt(0, 0) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L242] a = base2flt(ma, ea) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L243] b = base2flt(mb, eb) [L245] COND FALSE !(a < zero) [L248] COND TRUE a > zero [L249] tmp = 1 [L253] sa = tmp [L255] COND FALSE !(b < zero) [L258] COND TRUE b > zero [L259] tmp___0 = 1 [L263] sb = tmp___0 [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; [L84] COND TRUE a < b [L85] tmp = a [L86] a = b [L87] b = tmp [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) [L6] COND TRUE !(cond) [L7] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 95 locations, 6 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 680 SDtfs, 2059 SDslu, 2424 SDs, 0 SdLazy, 601 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 377 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 12000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 15:38:58,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:58,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:58,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:58,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:58,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:58,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:58,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:58,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:58,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:58,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:58,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:58,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:58,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:58,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:58,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:58,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:58,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:58,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:58,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:58,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:58,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:58,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:58,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:58,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:58,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:58,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:58,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:58,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:58,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:58,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:58,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:58,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:58,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:58,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:58,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:58,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:58,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:58,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:58,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:58,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:58,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 15:38:58,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:58,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:58,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:58,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:58,571 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:58,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:58,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:58,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:58,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:58,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:58,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:58,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:58,576 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 15:38:58,576 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 15:38:58,576 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:58,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:58,578 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:58,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:58,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:58,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:58,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:58,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:58,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:58,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:58,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:58,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:58,581 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 15:38:58,581 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 15:38:58,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:58,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:58,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 15:38:58,583 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e04f2515dd5c7ce697460622800d33932bf1903 [2019-11-28 15:38:58,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:58,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:58,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:58,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:58,933 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:58,934 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-28 15:38:59,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f81ddf26/a52b036fb021456ca6313823cb033477/FLAG04000ab77 [2019-11-28 15:38:59,506 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:59,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-28 15:38:59,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f81ddf26/a52b036fb021456ca6313823cb033477/FLAG04000ab77 [2019-11-28 15:38:59,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f81ddf26/a52b036fb021456ca6313823cb033477 [2019-11-28 15:38:59,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:59,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:59,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:59,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:59,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:59,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:59" (1/1) ... [2019-11-28 15:38:59,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c23cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:59, skipping insertion in model container [2019-11-28 15:38:59,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:59" (1/1) ... [2019-11-28 15:38:59,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:59,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:39:00,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:00,167 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:39:00,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:00,298 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:39:00,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00 WrapperNode [2019-11-28 15:39:00,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:00,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:00,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:39:00,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:39:00,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:00,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:39:00,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:39:00,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:39:00,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... [2019-11-28 15:39:00,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:39:00,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:39:00,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:39:00,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:39:00,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:39:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:39:00,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:39:01,073 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:39:01,073 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-28 15:39:01,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:01 BoogieIcfgContainer [2019-11-28 15:39:01,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:39:01,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:39:01,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:39:01,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:39:01,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:59" (1/3) ... [2019-11-28 15:39:01,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e138869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:01, skipping insertion in model container [2019-11-28 15:39:01,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:00" (2/3) ... [2019-11-28 15:39:01,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e138869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:01, skipping insertion in model container [2019-11-28 15:39:01,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:01" (3/3) ... [2019-11-28 15:39:01,084 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2019-11-28 15:39:01,095 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:39:01,104 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 15:39:01,125 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 15:39:01,159 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:39:01,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:39:01,160 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:39:01,160 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:39:01,161 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:39:01,161 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:39:01,162 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:39:01,162 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:39:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-11-28 15:39:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:39:01,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:01,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:01,186 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash 934616753, now seen corresponding path program 1 times [2019-11-28 15:39:01,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:01,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428670355] [2019-11-28 15:39:01,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:01,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:39:01,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:01,345 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:01,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428670355] [2019-11-28 15:39:01,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:01,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 15:39:01,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295444411] [2019-11-28 15:39:01,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:01,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:01,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:01,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:01,413 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2019-11-28 15:39:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:01,698 INFO L93 Difference]: Finished difference Result 396 states and 606 transitions. [2019-11-28 15:39:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:39:01,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 15:39:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:01,728 INFO L225 Difference]: With dead ends: 396 [2019-11-28 15:39:01,729 INFO L226 Difference]: Without dead ends: 294 [2019-11-28 15:39:01,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:39:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-28 15:39:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 119. [2019-11-28 15:39:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 15:39:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2019-11-28 15:39:01,826 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 17 [2019-11-28 15:39:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:01,827 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2019-11-28 15:39:01,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2019-11-28 15:39:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:39:01,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:01,829 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:02,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 15:39:02,043 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1603282001, now seen corresponding path program 1 times [2019-11-28 15:39:02,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:02,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44337710] [2019-11-28 15:39:02,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:02,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:39:02,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:02,135 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:02,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44337710] [2019-11-28 15:39:02,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:02,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 15:39:02,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246842053] [2019-11-28 15:39:02,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:02,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:02,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:02,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:02,159 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand 5 states. [2019-11-28 15:39:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:02,413 INFO L93 Difference]: Finished difference Result 393 states and 542 transitions. [2019-11-28 15:39:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:39:02,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 15:39:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:02,417 INFO L225 Difference]: With dead ends: 393 [2019-11-28 15:39:02,417 INFO L226 Difference]: Without dead ends: 336 [2019-11-28 15:39:02,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:39:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-28 15:39:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 185. [2019-11-28 15:39:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-28 15:39:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 268 transitions. [2019-11-28 15:39:02,446 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 268 transitions. Word has length 21 [2019-11-28 15:39:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:02,447 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 268 transitions. [2019-11-28 15:39:02,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 268 transitions. [2019-11-28 15:39:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:39:02,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:02,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:02,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 15:39:02,663 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1210254991, now seen corresponding path program 1 times [2019-11-28 15:39:02,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:02,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053011399] [2019-11-28 15:39:02,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:02,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:39:02,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:02,759 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:02,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053011399] [2019-11-28 15:39:02,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:02,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 15:39:02,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560971497] [2019-11-28 15:39:02,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:02,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:02,781 INFO L87 Difference]: Start difference. First operand 185 states and 268 transitions. Second operand 5 states. [2019-11-28 15:39:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:02,976 INFO L93 Difference]: Finished difference Result 377 states and 534 transitions. [2019-11-28 15:39:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:39:02,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 15:39:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:02,979 INFO L225 Difference]: With dead ends: 377 [2019-11-28 15:39:02,980 INFO L226 Difference]: Without dead ends: 294 [2019-11-28 15:39:02,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-28 15:39:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2019-11-28 15:39:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-28 15:39:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 400 transitions. [2019-11-28 15:39:03,024 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 400 transitions. Word has length 21 [2019-11-28 15:39:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:03,025 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 400 transitions. [2019-11-28 15:39:03,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 400 transitions. [2019-11-28 15:39:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:39:03,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:03,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:03,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 15:39:03,254 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1309704943, now seen corresponding path program 1 times [2019-11-28 15:39:03,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:03,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922351058] [2019-11-28 15:39:03,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:03,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 15:39:03,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:03,371 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:03,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922351058] [2019-11-28 15:39:03,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:03,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-28 15:39:03,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024137247] [2019-11-28 15:39:03,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:39:03,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:39:03,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:39:03,397 INFO L87 Difference]: Start difference. First operand 277 states and 400 transitions. Second operand 6 states. [2019-11-28 15:39:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:03,597 INFO L93 Difference]: Finished difference Result 394 states and 552 transitions. [2019-11-28 15:39:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:39:03,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 15:39:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:03,601 INFO L225 Difference]: With dead ends: 394 [2019-11-28 15:39:03,601 INFO L226 Difference]: Without dead ends: 317 [2019-11-28 15:39:03,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 15:39:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-28 15:39:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 257. [2019-11-28 15:39:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-28 15:39:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 364 transitions. [2019-11-28 15:39:03,623 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 364 transitions. Word has length 21 [2019-11-28 15:39:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:03,623 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 364 transitions. [2019-11-28 15:39:03,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:39:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 364 transitions. [2019-11-28 15:39:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:39:03,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:03,625 INFO L410 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] [2019-11-28 15:39:03,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 15:39:03,847 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:03,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash -610901190, now seen corresponding path program 1 times [2019-11-28 15:39:03,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:03,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566977159] [2019-11-28 15:39:03,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:03,907 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 15:39:03,912 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:03,962 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:03,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566977159] [2019-11-28 15:39:03,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:03,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-28 15:39:03,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745654564] [2019-11-28 15:39:03,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:39:03,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:39:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:03,972 INFO L87 Difference]: Start difference. First operand 257 states and 364 transitions. Second operand 7 states. [2019-11-28 15:39:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:04,299 INFO L93 Difference]: Finished difference Result 401 states and 540 transitions. [2019-11-28 15:39:04,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 15:39:04,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 15:39:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:04,303 INFO L225 Difference]: With dead ends: 401 [2019-11-28 15:39:04,303 INFO L226 Difference]: Without dead ends: 353 [2019-11-28 15:39:04,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-28 15:39:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-28 15:39:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 247. [2019-11-28 15:39:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-28 15:39:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2019-11-28 15:39:04,321 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 25 [2019-11-28 15:39:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:04,321 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2019-11-28 15:39:04,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:39:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2019-11-28 15:39:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:39:04,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:04,328 INFO L410 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] [2019-11-28 15:39:04,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 15:39:04,549 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:04,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:04,550 INFO L82 PathProgramCache]: Analyzing trace with hash -873114857, now seen corresponding path program 1 times [2019-11-28 15:39:04,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:04,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337811327] [2019-11-28 15:39:04,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:04,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:39:04,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:04,608 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:04,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337811327] [2019-11-28 15:39:04,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:04,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 15:39:04,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928965166] [2019-11-28 15:39:04,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:39:04,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:04,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:39:04,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:39:04,631 INFO L87 Difference]: Start difference. First operand 247 states and 347 transitions. Second operand 6 states. [2019-11-28 15:39:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:04,689 INFO L93 Difference]: Finished difference Result 455 states and 634 transitions. [2019-11-28 15:39:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:39:04,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 15:39:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:04,693 INFO L225 Difference]: With dead ends: 455 [2019-11-28 15:39:04,694 INFO L226 Difference]: Without dead ends: 380 [2019-11-28 15:39:04,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-28 15:39:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 309. [2019-11-28 15:39:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-28 15:39:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 422 transitions. [2019-11-28 15:39:04,719 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 422 transitions. Word has length 29 [2019-11-28 15:39:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:04,720 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 422 transitions. [2019-11-28 15:39:04,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:39:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 422 transitions. [2019-11-28 15:39:04,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:39:04,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:04,722 INFO L410 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] [2019-11-28 15:39:04,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 15:39:04,933 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:04,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1737423153, now seen corresponding path program 1 times [2019-11-28 15:39:04,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:04,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252252520] [2019-11-28 15:39:04,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:05,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 15:39:05,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:05,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:39:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:05,087 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:05,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252252520] [2019-11-28 15:39:05,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:05,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 15:39:05,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061664134] [2019-11-28 15:39:05,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:39:05,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:39:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:39:05,131 INFO L87 Difference]: Start difference. First operand 309 states and 422 transitions. Second operand 6 states. [2019-11-28 15:39:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:05,298 INFO L93 Difference]: Finished difference Result 456 states and 627 transitions. [2019-11-28 15:39:05,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:39:05,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 15:39:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:05,301 INFO L225 Difference]: With dead ends: 456 [2019-11-28 15:39:05,302 INFO L226 Difference]: Without dead ends: 454 [2019-11-28 15:39:05,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:39:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-28 15:39:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 307. [2019-11-28 15:39:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-28 15:39:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 418 transitions. [2019-11-28 15:39:05,321 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 418 transitions. Word has length 29 [2019-11-28 15:39:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:05,321 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 418 transitions. [2019-11-28 15:39:05,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:39:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 418 transitions. [2019-11-28 15:39:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 15:39:05,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:05,323 INFO L410 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] [2019-11-28 15:39:05,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 15:39:05,534 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:05,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1232022065, now seen corresponding path program 1 times [2019-11-28 15:39:05,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:05,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144942333] [2019-11-28 15:39:05,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:05,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 15:39:05,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:05,662 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:05,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144942333] [2019-11-28 15:39:05,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:05,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2019-11-28 15:39:05,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196868415] [2019-11-28 15:39:05,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 15:39:05,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:05,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 15:39:05,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 15:39:05,767 INFO L87 Difference]: Start difference. First operand 307 states and 418 transitions. Second operand 13 states. [2019-11-28 15:39:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:06,956 INFO L93 Difference]: Finished difference Result 581 states and 777 transitions. [2019-11-28 15:39:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 15:39:06,957 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-28 15:39:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:06,960 INFO L225 Difference]: With dead ends: 581 [2019-11-28 15:39:06,961 INFO L226 Difference]: Without dead ends: 540 [2019-11-28 15:39:06,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-11-28 15:39:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-28 15:39:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2019-11-28 15:39:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-28 15:39:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 504 transitions. [2019-11-28 15:39:06,990 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 504 transitions. Word has length 30 [2019-11-28 15:39:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:06,991 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 504 transitions. [2019-11-28 15:39:06,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 15:39:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 504 transitions. [2019-11-28 15:39:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 15:39:06,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:06,993 INFO L410 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] [2019-11-28 15:39:07,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 15:39:07,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763763, now seen corresponding path program 1 times [2019-11-28 15:39:07,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:07,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14715301] [2019-11-28 15:39:07,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:07,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:39:07,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:07,280 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:07,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14715301] [2019-11-28 15:39:07,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 15:39:07,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346258406] [2019-11-28 15:39:07,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:39:07,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:39:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:39:07,296 INFO L87 Difference]: Start difference. First operand 372 states and 504 transitions. Second operand 6 states. [2019-11-28 15:39:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:07,377 INFO L93 Difference]: Finished difference Result 429 states and 579 transitions. [2019-11-28 15:39:07,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:39:07,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-28 15:39:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:07,380 INFO L225 Difference]: With dead ends: 429 [2019-11-28 15:39:07,381 INFO L226 Difference]: Without dead ends: 424 [2019-11-28 15:39:07,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:39:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-28 15:39:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 372. [2019-11-28 15:39:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-28 15:39:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 499 transitions. [2019-11-28 15:39:07,401 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 499 transitions. Word has length 30 [2019-11-28 15:39:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:07,402 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 499 transitions. [2019-11-28 15:39:07,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:39:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 499 transitions. [2019-11-28 15:39:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:39:07,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:07,404 INFO L410 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] [2019-11-28 15:39:07,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 15:39:07,623 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:07,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1505781804, now seen corresponding path program 1 times [2019-11-28 15:39:07,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:07,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835681305] [2019-11-28 15:39:07,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:07,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:39:07,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:07,688 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:39:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:07,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835681305] [2019-11-28 15:39:07,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:07,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 15:39:07,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254304565] [2019-11-28 15:39:07,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:39:07,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:39:07,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:39:07,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:39:07,726 INFO L87 Difference]: Start difference. First operand 372 states and 499 transitions. Second operand 6 states. [2019-11-28 15:39:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:07,816 INFO L93 Difference]: Finished difference Result 775 states and 1019 transitions. [2019-11-28 15:39:07,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:39:07,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-28 15:39:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:07,821 INFO L225 Difference]: With dead ends: 775 [2019-11-28 15:39:07,821 INFO L226 Difference]: Without dead ends: 716 [2019-11-28 15:39:07,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-28 15:39:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 390. [2019-11-28 15:39:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-11-28 15:39:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 524 transitions. [2019-11-28 15:39:07,849 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 524 transitions. Word has length 31 [2019-11-28 15:39:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:07,849 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 524 transitions. [2019-11-28 15:39:07,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:39:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 524 transitions. [2019-11-28 15:39:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:39:07,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:07,852 INFO L410 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] [2019-11-28 15:39:08,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 15:39:08,072 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:08,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1078465644, now seen corresponding path program 1 times [2019-11-28 15:39:08,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:39:08,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795586225] [2019-11-28 15:39:08,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-28 15:39:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:39:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:39:08,200 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-28 15:39:08,200 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:39:08,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 15:39:08,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:39:08 BoogieIcfgContainer [2019-11-28 15:39:08,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:39:08,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:39:08,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:39:08,482 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:39:08,483 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:01" (3/4) ... [2019-11-28 15:39:08,486 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:39:08,642 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:39:08,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:39:08,648 INFO L168 Benchmark]: Toolchain (without parser) took 8794.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 955.0 MB in the beginning and 899.4 MB in the end (delta: 55.6 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:08,649 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:08,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:08,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:08,652 INFO L168 Benchmark]: Boogie Preprocessor took 42.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:08,652 INFO L168 Benchmark]: RCFGBuilder took 677.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:08,653 INFO L168 Benchmark]: TraceAbstraction took 7404.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 899.4 MB in the end (delta: 183.1 MB). Peak memory consumption was 252.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:08,653 INFO L168 Benchmark]: Witness Printer took 164.76 ms. Allocated memory is still 1.2 GB. Free memory is still 899.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:08,655 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 677.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7404.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 899.4 MB in the end (delta: 183.1 MB). Peak memory consumption was 252.3 MB. Max. memory is 11.5 GB. * Witness Printer took 164.76 ms. Allocated memory is still 1.2 GB. Free memory is still 899.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add ; [L223] unsigned int zero ; [L224] int sa ; [L225] int sb ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int tmp___1 ; [L229] int tmp___2 ; [L230] int tmp___3 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L233] int tmp___6 ; [L234] int tmp___7 ; [L235] int tmp___8 ; [L236] int tmp___9 ; [L237] int __retres23 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L241] zero = base2flt(0, 0) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L242] a = base2flt(ma, ea) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L243] b = base2flt(mb, eb) [L245] COND FALSE !(a < zero) [L248] COND TRUE a > zero [L249] tmp = 1 [L253] sa = tmp [L255] COND FALSE !(b < zero) [L258] COND TRUE b > zero [L259] tmp___0 = 1 [L263] sb = tmp___0 [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; [L84] COND TRUE a < b [L85] tmp = a [L86] a = b [L87] b = tmp [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) [L6] COND FALSE !(!(cond)) [L105] delta = ea - eb [L6] COND TRUE !(cond) [L7] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 95 locations, 6 error locations. Result: UNSAFE, OverallTime: 7.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1352 SDtfs, 3612 SDslu, 5031 SDs, 0 SdLazy, 992 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 541 GetRequests, 445 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1273 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 22852 SizeOfPredicates, 45 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...