./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i -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 573d04c3ab16ffed1ccac6c6179d92b670a825d7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-0ed9222-m [2019-01-14 16:50:43,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 16:50:43,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 16:50:43,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 16:50:43,833 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 16:50:43,834 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 16:50:43,835 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 16:50:43,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 16:50:43,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 16:50:43,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 16:50:43,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 16:50:43,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 16:50:43,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 16:50:43,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 16:50:43,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 16:50:43,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 16:50:43,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 16:50:43,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 16:50:43,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 16:50:43,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 16:50:43,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 16:50:43,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 16:50:43,860 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 16:50:43,860 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 16:50:43,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 16:50:43,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 16:50:43,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 16:50:43,864 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 16:50:43,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 16:50:43,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 16:50:43,866 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 16:50:43,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 16:50:43,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 16:50:43,868 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 16:50:43,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 16:50:43,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 16:50:43,870 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 16:50:43,886 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 16:50:43,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 16:50:43,888 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 16:50:43,888 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 16:50:43,888 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 16:50:43,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 16:50:43,889 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 16:50:43,890 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 16:50:43,890 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 16:50:43,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 16:50:43,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 16:50:43,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 16:50:43,890 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 16:50:43,891 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 16:50:43,892 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 16:50:43,892 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 16:50:43,892 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 16:50:43,892 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 16:50:43,892 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 16:50:43,893 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 16:50:43,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 16:50:43,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 16:50:43,894 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 16:50:43,894 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 16:50:43,894 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 16:50:43,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 16:50:43,895 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 16:50:43,896 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2019-01-14 16:50:43,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 16:50:43,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 16:50:43,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 16:50:43,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 16:50:43,950 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 16:50:43,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2019-01-14 16:50:44,009 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1e906ed/b400843873fc4794a1fb6b19bdbaf233/FLAG1deffc168 [2019-01-14 16:50:44,563 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 16:50:44,567 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2019-01-14 16:50:44,593 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1e906ed/b400843873fc4794a1fb6b19bdbaf233/FLAG1deffc168 [2019-01-14 16:50:44,809 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1e906ed/b400843873fc4794a1fb6b19bdbaf233 [2019-01-14 16:50:44,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 16:50:44,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 16:50:44,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 16:50:44,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 16:50:44,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 16:50:44,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:50:44" (1/1) ... [2019-01-14 16:50:44,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9d71c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:44, skipping insertion in model container [2019-01-14 16:50:44,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:50:44" (1/1) ... [2019-01-14 16:50:44,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 16:50:44,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 16:50:45,187 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:50:45,199 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 16:50:45,344 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:50:45,405 INFO L195 MainTranslator]: Completed translation [2019-01-14 16:50:45,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45 WrapperNode [2019-01-14 16:50:45,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 16:50:45,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 16:50:45,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 16:50:45,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 16:50:45,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 16:50:45,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 16:50:45,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 16:50:45,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 16:50:45,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 16:50:45,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 16:50:45,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 16:50:45,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 16:50:45,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (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-01-14 16:50:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 16:50:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 16:50:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 16:50:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 16:50:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 16:50:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 16:50:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 16:50:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 16:50:46,071 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 16:50:46,072 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-14 16:50:46,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:50:46 BoogieIcfgContainer [2019-01-14 16:50:46,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 16:50:46,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 16:50:46,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 16:50:46,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 16:50:46,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 04:50:44" (1/3) ... [2019-01-14 16:50:46,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693e93a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:50:46, skipping insertion in model container [2019-01-14 16:50:46,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (2/3) ... [2019-01-14 16:50:46,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693e93a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:50:46, skipping insertion in model container [2019-01-14 16:50:46,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:50:46" (3/3) ... [2019-01-14 16:50:46,081 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified_false-unreach-call_false-valid-memcleanup.i [2019-01-14 16:50:46,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 16:50:46,101 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 16:50:46,118 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 16:50:46,149 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 16:50:46,149 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 16:50:46,150 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 16:50:46,150 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 16:50:46,150 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 16:50:46,150 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 16:50:46,150 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 16:50:46,151 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 16:50:46,151 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 16:50:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-01-14 16:50:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 16:50:46,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:46,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:46,177 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:46,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1957812527, now seen corresponding path program 1 times [2019-01-14 16:50:46,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:46,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:46,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:46,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:46,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:50:46,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 16:50:46,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 16:50:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 16:50:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 16:50:46,310 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-01-14 16:50:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:46,329 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2019-01-14 16:50:46,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 16:50:46,331 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-14 16:50:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:46,341 INFO L225 Difference]: With dead ends: 48 [2019-01-14 16:50:46,342 INFO L226 Difference]: Without dead ends: 24 [2019-01-14 16:50:46,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 16:50:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-14 16:50:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-14 16:50:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 16:50:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 16:50:46,381 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2019-01-14 16:50:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:46,381 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 16:50:46,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 16:50:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-01-14 16:50:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 16:50:46,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:46,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:46,383 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:46,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1580862863, now seen corresponding path program 1 times [2019-01-14 16:50:46,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:46,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:46,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:50:46,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 16:50:46,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 16:50:46,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 16:50:46,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 16:50:46,451 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2019-01-14 16:50:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:46,516 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2019-01-14 16:50:46,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 16:50:46,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 16:50:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:46,518 INFO L225 Difference]: With dead ends: 46 [2019-01-14 16:50:46,518 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 16:50:46,519 INFO L631 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-01-14 16:50:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 16:50:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-01-14 16:50:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 16:50:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-01-14 16:50:46,532 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2019-01-14 16:50:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:46,533 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 16:50:46,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 16:50:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2019-01-14 16:50:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 16:50:46,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:46,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:46,534 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:46,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2031015874, now seen corresponding path program 1 times [2019-01-14 16:50:46,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:46,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:46,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:50:46,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:50:46,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:46,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:50:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:46,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 16:50:46,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 16:50:46,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 16:50:46,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 16:50:46,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 16:50:46,865 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 5 states. [2019-01-14 16:50:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:47,164 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2019-01-14 16:50:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 16:50:47,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-14 16:50:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:47,168 INFO L225 Difference]: With dead ends: 62 [2019-01-14 16:50:47,168 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 16:50:47,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 16:50:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 16:50:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-01-14 16:50:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 16:50:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-01-14 16:50:47,175 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 19 [2019-01-14 16:50:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:47,176 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-14 16:50:47,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 16:50:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-01-14 16:50:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 16:50:47,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:47,177 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:47,177 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash -282378703, now seen corresponding path program 1 times [2019-01-14 16:50:47,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:47,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:47,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:47,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:50:47,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:50:47,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:47,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:50:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:47,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:50:47,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 16:50:47,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 16:50:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 16:50:47,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 16:50:47,527 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 6 states. [2019-01-14 16:50:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:47,592 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-01-14 16:50:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 16:50:47,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 16:50:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:47,596 INFO L225 Difference]: With dead ends: 60 [2019-01-14 16:50:47,596 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 16:50:47,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 16:50:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 16:50:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-01-14 16:50:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 16:50:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-01-14 16:50:47,604 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 26 [2019-01-14 16:50:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:47,605 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-01-14 16:50:47,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 16:50:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2019-01-14 16:50:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 16:50:47,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:47,606 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:47,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 700996956, now seen corresponding path program 2 times [2019-01-14 16:50:47,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:47,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:47,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:47,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:47,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:50:47,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:50:47,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 16:50:47,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 16:50:47,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:50:47,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:50:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:47,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:50:47,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 16:50:47,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 16:50:47,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 16:50:47,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 16:50:47,989 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 7 states. [2019-01-14 16:50:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:48,329 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2019-01-14 16:50:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 16:50:48,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-01-14 16:50:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:48,332 INFO L225 Difference]: With dead ends: 67 [2019-01-14 16:50:48,332 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 16:50:48,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 16:50:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 16:50:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-01-14 16:50:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 16:50:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-01-14 16:50:48,341 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 33 [2019-01-14 16:50:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:48,344 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-01-14 16:50:48,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 16:50:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2019-01-14 16:50:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 16:50:48,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:48,346 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:48,346 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:48,347 INFO L82 PathProgramCache]: Analyzing trace with hash -338892847, now seen corresponding path program 3 times [2019-01-14 16:50:48,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:48,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:50:48,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:48,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:50:48,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:50:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 16:50:49,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 16:50:49,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:50:49,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:50:49,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 16:50:49,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 16:50:49,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 16:50:49,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2019-01-14 16:50:49,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2019-01-14 16:50:49,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-01-14 16:50:49,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-14 16:50:49,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-01-14 16:50:49,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:49,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-14 16:50:49,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,770 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:66, output treesize:23 [2019-01-14 16:50:49,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2019-01-14 16:50:49,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2019-01-14 16:50:49,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:49,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2019-01-14 16:50:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 16:50:50,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 16:50:50,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2019-01-14 16:50:50,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 16:50:50,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 16:50:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-01-14 16:50:50,168 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 16 states. [2019-01-14 16:50:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:51,576 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2019-01-14 16:50:51,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 16:50:51,580 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-01-14 16:50:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:51,581 INFO L225 Difference]: With dead ends: 81 [2019-01-14 16:50:51,581 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 16:50:51,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-01-14 16:50:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 16:50:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2019-01-14 16:50:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 16:50:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2019-01-14 16:50:51,589 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 40 [2019-01-14 16:50:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:51,589 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-01-14 16:50:51,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 16:50:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2019-01-14 16:50:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 16:50:51,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:51,591 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:51,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:51,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:51,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2038353598, now seen corresponding path program 1 times [2019-01-14 16:50:51,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:51,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:51,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:51,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:50:51,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 16:50:52,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:50:52,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:50:52,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:52,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:50:52,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 16:50:52,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 16:50:52,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 16:50:52,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 16:50:52,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 16:50:52,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 16:50:52,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 16:50:52,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,762 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2019-01-14 16:50:52,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2019-01-14 16:50:52,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-01-14 16:50:52,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-14 16:50:52,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-01-14 16:50:52,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:52,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-14 16:50:52,928 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,956 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2019-01-14 16:50:52,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-14 16:50:52,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-14 16:50:52,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:52,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:53,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:53,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2019-01-14 16:50:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 16:50:53,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:50:53,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-01-14 16:50:53,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 16:50:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 16:50:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-01-14 16:50:53,133 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 20 states. [2019-01-14 16:50:53,723 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 16:50:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:54,208 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2019-01-14 16:50:54,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 16:50:54,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-01-14 16:50:54,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:54,211 INFO L225 Difference]: With dead ends: 86 [2019-01-14 16:50:54,212 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 16:50:54,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2019-01-14 16:50:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 16:50:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2019-01-14 16:50:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 16:50:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2019-01-14 16:50:54,220 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 47 [2019-01-14 16:50:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:54,220 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2019-01-14 16:50:54,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 16:50:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2019-01-14 16:50:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 16:50:54,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:54,222 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:54,222 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2038355520, now seen corresponding path program 1 times [2019-01-14 16:50:54,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:54,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:54,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:54,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:54,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 16:50:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 16:50:54,723 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 16:50:54,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 04:50:54 BoogieIcfgContainer [2019-01-14 16:50:54,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 16:50:54,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 16:50:54,794 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 16:50:54,794 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 16:50:54,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:50:46" (3/4) ... [2019-01-14 16:50:54,798 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 16:50:54,884 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 16:50:54,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 16:50:54,885 INFO L168 Benchmark]: Toolchain (without parser) took 10071.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -296.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2019-01-14 16:50:54,886 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:50:54,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-01-14 16:50:54,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.66 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-01-14 16:50:54,887 INFO L168 Benchmark]: Boogie Preprocessor took 37.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 16:50:54,888 INFO L168 Benchmark]: RCFGBuilder took 570.53 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-14 16:50:54,888 INFO L168 Benchmark]: TraceAbstraction took 8718.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.0 MB). Peak memory consumption was 349.1 MB. Max. memory is 11.5 GB. [2019-01-14 16:50:54,889 INFO L168 Benchmark]: Witness Printer took 90.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-01-14 16:50:54,892 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.66 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 37.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 570.53 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8718.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.0 MB). Peak memory consumption was 349.1 MB. Max. memory is 11.5 GB. * Witness Printer took 90.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; [L568] DLL head = ((void *)0); [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND FALSE !(\read(head)) [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND FALSE !(len > 0) [L585] return head; [L589] DLL head = dll_create(len); [L590] head->next [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. UNSAFE Result, 8.6s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 182 SDtfs, 561 SDslu, 451 SDs, 0 SdLazy, 525 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 401 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 44667 SizeOfPredicates, 41 NumberOfNonLiveVariables, 772 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 178/310 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...